ppxscal/embedding_network huggingface dataset:
Policy-Driven Negotiation for Authorization in the Grid
Authors: Ionut Constandache, Daniel Olmedilla, Frank Siebenlist
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

many Grid services deployments, the clients and servers reside in different administrative domains. Hence, there is a requirement both to discover each other's authorization policy, in order to be able to present the right assertions that allow access, and to reveal as little as possible of the access policy details to unauthorized parties. This paper describes a mechanism where the client and servers are semantically annotated with policies that protect their resources. These annotations specify both constraints and capabilities that are used during a negotiation to reason about and communicate the need to see certain credentials from the other party and to determine whether requested credentials can be obtained and revealed. The result of the negotiation is a state where both parties have satisfied their policy constraints for a subsequent interaction or where such interaction is disallowed by either or both. Furthermore, we present an implementation of a prototype, based on the PEERTRUST policy language, and a reasoning engine that is integrated in the Web services runtime component of the Globus Toolkit. The negotiation process is facilitated through the implementation of WSRF-compliant service interfaces for protocol message exchanges.
Optimization based grayscale image colorization
Authors: Dongdong Nie, Qinyong Ma, Lizhuang Ma, Shuangjiu Xiao
Venue: Pattern Recognition Letters (2007)

An optimization based interactive grayscale image colorization method is presented in this paper. It is an interactive colorization method, whereas the only thing user need to do is to provide some color hints by scribbling or seed pixels. The main contribution of this paper is that the colorization method greatly reduces computation time with the same good results in image quality by quadtree decomposition based non-uniform sampling. Moreover, by introducing a new simple weighting function to represent intensity similarity in the cost function, annoying color diffusion among different regions is alleviated. Experiments show that this method gives the same good quality of colorized images as the method of Levin et al. with a fraction of the computational cost.
Using Feature Selection For Object Segmentation and Tracking
Authors: Mohand Said Allili, Djemel Ziou
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

Most image segmentation algorithms in the past are based on optimizing an objective function that aims to achieve the similarity between several low-level features to build a partition of the image into homogeneous regions. In the present paper, we propose to incorporate the relevance (selection) of the grouping features to enforce the segmentation toward the capturing of objects of interest. The relevance of the features is determined through a set of positive and negative examples of a specific object defined a priori by the user. The calculation of the relevance of the features is performed by maximizing an objective function defined on the mixture likelihoods of the positive and negative object examples sets. The incorporation of the features relevance in the object segmentation is formulated through an energy functional which is minimized by using level set active contours. We show the efficiency of the approach on several examples of object of interest segmentation and tracking where the features relevance was used.
Two-dimensional retiming with low memory requirements
Authors: T. C. Denk
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper considers throughput and memory requirements in architectures which operate on two-dimensional (2D) digital signals. We present a novel technique for retiming a 2D data-flow graph to meet a given throughput constraint while keeping the memory required by the architecture low. This technique, which we call orthogonal two-dimensional retiming, is posed as two linear programming problems which can be solved in polynomial time. Our results show that, for a given throughput constraint, the orthogonal two-dimensional retiming formulation leads to architectures which require less memory than architectures designed using previously known techniques.
VIm-Scan: A Low Overhead Scan Design Approach for Protection of Secret Key in Scan-Based Secure Chips
Authors: Somnath Paul, Rajat Subhra Chakraborty, Swarup Bhunia
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

Scan-based DFT enhances the testability of a system by making its internal nodes more observable and controllable. However, in case of a secure chip, scan chain increases its vulnerability to attack, where the attacker can extract secret information by scanning out states of internal nodes. This paper presents VIm-Scan: a low overhead scan design methodology that maintains all the advantages of a traditional scan-based testing yet prevents secure key extraction through the scan out process. Experimental results show that the proposed approach entails significantly lesser design overhead (~5X reduction in number of additional gates) with comparable or better protection against attack than existing techniques.
Ant Routing in Mobile Ad Hoc Networks
Authors: S. S. Dhillon, X. Arbona, P. Van Mieghem
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

We study the performance of ant routing for static and dynamic network topologies. We also compare the performance of ant routing with AODV and DSR for ad hoc networks. The simulations show that the ant routing algorithm performs well for static topologies. However, the routing overhead in ant routing is more than AODV and DSR. Therefore, ant routing performs worse than AODV and DSR in ad hoc networks because of the limited capacity and restrictions on the buffer size. Moreover, with mobility, a large number of data packets in ant routing experience loops that degrade the end-to-end performance.
Making the Complex Simple
Authors: Julian V. Noble
Venue: Computing in Science and Engineering (2007)

This installment of Computing Prescriptions illustrates how complex arithmetic can simplify algorithms in two-dimensional Cartesian vector space as well as how to make difficult numerical integrals tractable. In other words, computer languages for scientific applications should support complex arithmetic.
Unsupervised learning of a finite discrete mixture: Applications to texture modeling and image databases summarization
Authors: Nizar Bouguila, Djemel Ziou
Venue: Journal of Visual Communication and Image Representation (2007)

This paper presents an unsupervised learning algorithm for fitting a finite mixture model based on the Multinomial Dirichlet distribution (MDD). This mixture is particularly useful for modeling discrete data (vectors of counts). The algorithm proposed is based on the expectation maximization (EM) approach. This mixture is used to improve image databases categorization by integrating semantic features and to produce a new texture model. For the texture modeling problem, the results are reported on the Vistex texture image database from the MIT Media Lab.
The Impact of Information Technology on the Temporal Optimization of Supply Chain Performance
Authors: Ken Dozier
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The objective of this paper is to suggest a systematic means by which the timing and focus of information technology policies can be used to optimize supply chain performance and reduce production times. This is done by extending an earlier statistical physics model for quasi-static situations to examine temporal phenomena in manufacturing supply chains.
Frequency recovery of narrow-band speech using adaptive spline neural networks
Authors: A. Uncini
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

A new system for speech quality enhancement (SQE) is presented. A SQE system attempts to recover the high and low frequencies from a narrow-band speech signal, usually working as a post-processor at the receiver side of a transmission system. The new system operates directly in the frequency domain using complex-valued neural networks. In order to reduce the computational burden and improve the generalization capabilities, a new architecture based on a previously introduced neural network, called the adaptive spline neural network (ASNN), is employed. Experimental results demonstrate the effectiveness of the proposed method.
Continuous Time Sigma Delta Modulator Employing a Novel Comparator Architecture
Authors: Vijay U.K., Amrutur Bharadwaj
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

A novel comparator architecture is proposed for high speed operation in low voltage environment. Performance comparison with a conventional regenerative comparator shows a speed-up of 41%. The proposed comparator is embedded in a continuous time Sigma-delta ADC so as to reduce the quantizer delay and hence minimizes the excess loop delay problem. A performance enhancement of 1dB in the dynamic range of the ADC is achieved with this new comparator. We have implemented this ADC in a standard single-poly 8-Metal 0.13ìm UMC process. The entire system operates at 1.2V supply providing a dynamic range of 32dB consuming 720ìW of power and occupies an area of 0.1mm2
Fuzzy biasless simulated evolution for multiobjective VLSI placement
Authors: J. A. Khan, S. M. Sait, M. R. Minhas
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

In each iteration of a simulated evolution (SE) algorithm for VLSI placement, poorly placed cells are selected probabilistically, based on a measure known as 'goodness'. To compensate for the error in the goodness calculation (and to maintain the number of selected cells within some limit), a parameter known as 'bias' is used, which has major impact on the algorithm's run-time and on the quality of the solution subspace searched. However, it is difficult to select the appropriate value of this selection bias because it varies for each problem instance. In this paper, a biasless selection scheme for the SE algorithm is proposed. This scheme eliminates the human interaction needed in the selection of the bias value for each problem instance. Due to the imprecise nature of the design information at the placement stage, fuzzy logic is used in all stages of the SE algorithm. The proposed scheme was compared with an adaptive bias scheme and was always able to achieve better solutions.
Performability Models for Multi-Server Systems with High-Variance Repair Durations
Authors: Hans-Peter Schwefel, Imad Antonios
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

We consider cluster systems with multiple nodes where each server is prone to run tasks at a degraded level of service due to some software or hardware fault. The cluster serves tasks generated by remote clients, which are potentially queued at a dispatcher. We present an analytic queueing model of such systems, represented as an M/MMPP/1 queue, and derive and analyze exact numerical solutions for the mean and tail-probabilities of the queue-length distribution. The analysis shows that the distribution of the repair time is critical for these performability metrics. Additionally, in the case of high-variance repair times, the model reveals so-called blow-up points, at which the performance characteristics change dramatically. Since this blowup behavior is sensitive to a change in model parameters, it is critical for system designers to be aware of the conditions under which it occurs. Finally, we present simulation results that demonstrate the robustness of this qualitative blow-up behavior towards several model variations.
PinOS: a programmable framework for whole-system dynamic instrumentation
Authors: Prashanth P. Bungale, Chi-Keung Luk
Venue: Proceedings of the 3rd international conference on Virtual execution environments (2007)

PinOS is an extension of the Pin dynamic instrumentation framework for whole-system instrumentation, i.e., to instrument both kernel and user-level code. It achieves this by interposing between the subject system and hardware using virtualization techniques. Specifically, PinOS is built on top of the Xen virtual machine monitor with Intel VT technology to allow instrumentation of unmodified OSes. PinOS is based on software dynamic translation and hence can perform pervasive fine-grain instrumentation. By inheriting the powerful instrumentation API from Pin, plus introducing some new API for system-level instrumentation, PinOS can be used to write system-wide instrumentation tools for tasks like program analysis and architectural studies. As of today, PinOS can boot Linux on IA-32 in uniprocessor mode, and can instrument complex applications such as database and web servers.
Human Computer Interaction in the Pre-Hospital Setting
Authors: Mark Gaynor, Dan Myung, Raj Patel, Steve Moulton
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper describes the human computer interface of a new emergency medical services application, which uses several emerging technologies to clarify the inherent complexity and uncertainty of emergency pre-hospital patient care. These technologies include: 1) the integration and display of real-time physiological sensor data in parallel with manually entered human observations and treatments; 2) a meta-data approach to screen definitions to allow dynamic configuration; and 3) a rule-based data capture system to ensure complete and accurate data collection. These new technologies led us to design a flexible and efficient GUI that is capable of evolving as technology and medical science advance.
Adapting Geometric Attributes for Expression-Invariant 3D Face Recognition
Authors: Xiaoxing Li, Hao Zhang
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

We investigate the use of multiple intrinsic geometric at- tributes, including angles, geodesic distances, and curva- tures, for 3D face recognition, where each face is repre- sented by a triangle mesh, preprocessed to possess a uni- form connectivity. As invariance to facial expressions holds the key to improving recognition performance, we propose to train for the component-wise weights to be applied to each individual attribute, as well as the weights used to combine the attributes, in order to adapt to expression vari- ations. Using the eigenface approach based on the training results and a nearest neighbor classifier, we report recogni- tion results on the expression-rich GavabDB face database and the well-known Notre Dame FRGC 3D database. We also perform a cross validation between the two databases.
Speaker verification performance and the length of test sentence
Authors: Jialong He
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

It is known that the performance of a speaker verification system improves with the length of test sentences. However, little is known about the exact relation between the performance and the test length. That makes it difficult to compare the results from various studies in which different test lengths have been used to evaluate the systems. In this paper, we have proposed a method to calculate the verification error rates at any lengths of test sentences, as long as the error rates at two different lengths are given. The accuracy of this calculation method is demonstrated with a speaker verification experiment and with the results reported in literature. Good agreement is shown between the calculated values and that measured through experiments.
A markovian signature-based approach to IP traffic classification
Authors: Hamza Dahmouni, Sandrine Vaton, David Rossé
Venue: Proceedings of the 3rd annual ACM workshop on Mining network data (2007)

In this paper we present a real-time automatic process to traffic classification and to the detection of abnormal behaviors in IP traffic. The proposed method aims to detect anomalies in the traffic associated to a particular service, or to automatically recognize the service associated to a given sequence of packets at the transport layer. Service classification is becoming a central issue because of the emergence of new services (P2P, VoIP, Streaming video, etc...) which raises new challenges in resource reservation, pricing, network monitoring, etc... In order to identify a specific signature to an application, we first of all model the sequence of its packets at the transport layer by means of a first order Markov chain. Then, we decide which service should be associated to any new sequence by means of standard decision techniques (Maximum Likelihood criterion, Neyman-Pearson test). The evaluation of our automatic recognition procedure using live GPRS Orange France traffic traces demonstrates the feasibility and the excellent performance of this approach.
Analysis of watermarking systems in the frequency domain and its application to design of robust watermarking systems
Authors: A. Miyazaki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper aims to design robust watermarking systems in the frequency domain. We first present the general model of watermark embedding and extracting processes and carry out their analysis. Then we examine the robustness of the watermarking system against common image processing and clarify the reason why detection errors occur in the watermark extracting process. Based on the result, we improve the watermark extracting process and design the robust watermarking systems. The improvement is accomplished using deconvolution filter and neural network techniques. Numerical experiments using the DCT-based watermarking system show good performance as we expected.
Teaching teamwork communication with Kolb learning style theory
Authors: J. E. Sharp
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

This work-in-progress presentation discusses rationale and techniques for using Kolb learning style theory in the technical communication classroom and in the engineering classroom to train students in teamwork skills. Specifically, the speaker presents Kolb learning style theory and offers practical suggestions for applying it with emphasis on the advantages and challenges to students and instructors. Although not an empirical study itself the presentation describes a few pertinent preliminary results from a ten-year, on-going study of engineering students' learning styles and relates them to classroom teaching. 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
Implementation options for WCDMA
Authors: F. Honore
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper discusses the design tradeoffs and implementation options for building wideband CDMA systems. System on a chip (SOC) solutions have a range of implementation options, from processor cores to custom ASIC (or a mix of both), to satisfy the extremely challenging requirements of the digital baseband of a next generation wireless system. Additionally, good designs should have a roadmap that will take advantage of rapid improvements in process technology. This paper describes the use of coprocessors alongside DSPs to meet the demanding computational requirements of WCDMA. We show that a coprocessor based design still achieves reasonably efficient area and power use, maintains a high degree of programmability and has a good technology migration path.
Economy-based Content Replication for Peering Content Delivery Networks
Authors: Al-Mukaddim Khan Pathan, Rajkumar Buyya
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Existing Content Delivery Networks (CDNs) by nature are closed delivery networks which do not cooperate with other CDNs and in practice, islands of CDNs are formed. The current logical separation between contents and services in this context results in two content networking domains. In addition to that, meeting the Quality of Service requirements of clients according to negotiated Service Level Agreements is crucial for a CDN. Present trends in content networks and content networking capabilities give rise to the interest in interconnecting these networks. Hence, in this paper, we present an open, scalable, and Service- Oriented Architecture (SOA)-based system that assist the creation of open Content and Service Delivery Networks (CSDNs), which scale and support sharing of resources through peering with other CSDNs. To encourage resource sharing and peering arrangements between different CDN providers at global level, we propose using market-based models by introducing an economy-based strategy for content replication.
Regular embeddings of Kn,n where n is an odd prime power
Authors: Gareth A. Jones, Roman Nedela, Martin Škoviera
Venue: European Journal of Combinatorics (2007)

We show that if n=p^e where p is an odd prime and e>=1, then the complete bipartite graph K"n","n has p^e^-^1 regular embeddings in orientable surfaces. These maps, which are Cayley maps for cyclic and dihedral groups, have type {2n,n} and genus (n-1)(n-2)/2; one is reflexible, and the rest are chiral. The method involves groups which factorise as a product of two cyclic groups of order n. We deduce that if n is odd then K"n","n has at least n/@?"p"|"np orientable regular embeddings, and that this lower bound is attained if and only if no two primes p and q dividing n satisfy p=1mod(q).
A student-centered feedback control model of the educational process
Authors: M. H. Shor
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

ABET 2000 requires new approaches to quality control and continuous improvement in engineering programs. It is instructive to analyze this control in terms familiar to the engineering community and to consider the implications for classroom and program level practices. A common approach to program assessment is to monitor success statistically. This is analogous to using statistical process control with the educational program as the process and students as the inputs and outputs. It can identify problems but not suggest solutions. The paper explores an alternative view in which the student is the process and performance on program outcomes is the output. It models ABET 2000 and other outcome based education methods in these terms and points out consequences for assessment and instruction. Feedback control of learning as a student-centered process explains why certain instructional and assessment techniques are "best practices" and requires a significant departure from traditional methods.