ppxscal/embedding_network huggingface dataset:
Using academic competition to alleviate financial pressures for minority students
Authors: D. G. Kelley, M. G. Barchilon
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

According to a report prepared for the Commission on National Investment for Higher Education, colleges and universities are becoming less accessible to minority students because of decreased funding. Further, the literature shows that minority students' retention problems are often tied to financial difficulties. Thus, to help increase minority students' retention rates by alleviating financial pressures, we designed an NSF funded academic program, the Sun Devil Bridge Program (SDBP), that included a competitive scholarship component. This scholarship component rewarded academic excellence, motivated students to achieve, and helped reduce economic pressures so minority students could focus on academic success.
There are no Barker arrays having more than two dimensions
Authors: Jonathan Jedwab, Matthew G. Parker
Venue: Designs, Codes and Cryptography (2007)

Davis, Jedwab and Smith recently proved that there are no 2-dimensional Barker arrays except of size 2 × 2. We show that the existence of a (d + 1)-dimensional Barker array implies the existence of a d-dimensional Barker array with the same number of ± 1 elements. We deduce that there are no Barker arrays having more than two dimensions, as conjectured by Dymond in 1992.
Properties of the First Type of Covering-Based Rough Sets
Authors: William Zhu, Fei-Yue Wang
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Rough set theory has been proposed by Pawlak as a tool for dealing with the vagueness and granularity in information systems. The core concepts of classical rough sets are lower and upper approximations based on equivalence relations, or partitions. This paper studies covering-based generalized rough sets. In this setting, a covering can also generate a lower approximation operation and an upper approximation operation, but some of common properties of classical lower and upper approximation operations are no longer satisfied. We investigate conditions for a covering under which these properties hold for the covering-based lower and upper approximation operations.
Joint modulation for TDD/CDMA downlink
Authors: Luzhou Xu
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

In the down link of a TDD/CDMA (time division duplex/code division multiplex access) system, the signal's multipath propagation causes severe ISI (intersymbol interference) and MAI (multiple access interference). It is well-known that these interference may create a near-far effect in which the standard techniques such as conventional modulation, power control and RAKE receivers provide a poor performance. This paper presents a joint modulation approach, which will process signals in pre-distortion based on the estimated channel parameters in up-link. Due to the pre-distortion process, the MAI and ISI will be reduced or suppressed when signals arrive at the mobiles. Some numerical results are given, which show a great improvement using this joint modulation instead of conventional modulation. 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
Harmonic skeleton for realistic character animation
Authors: Grégoire Aujay, Franck Hétroy, Francis Lazarus, Christine Depraz
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

Current approaches to skeleton generation are based on topological and geometrical information only; this can be insufficient for realistic character animation, since the location of the joints does not usually match the real bone structure of the model. This paper proposes the use of anatomical information to enhance the skeleton. Using a harmonic function, this information can be recovered from the skeleton itself, which is guaranteed not to have undesired endpoints. The skeleton is computed as a Reeb graph of such a function over the surface of the model. Starting from one point selected on the head of the character, the entire process is fast, automatic and robust; it generates skeletons whose joints can be associated with the character's anatomy. Results are provided, including a quantitative validation of the generated skeletons.
Panel: Software Engineering: Graduate Education And Research Issues
Authors: J. L. Diaz-Herrera
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

This paper focuses on the freshman year of the Foundation Coalition program at Texas A&M University. The curriculum includes chemistry, English, engineering, math and physics taught in an integrated just in time fashion using technology and delivered in an active-collaborative environment to students working in teams of four. Through our thrusts of integration, teaming, active learning and technology we hope to produce engineers who can solve increasingly complex problems more effectively. Graphical analysis, not generally taught or used by engineering students, has provided the best avenue for integration of graphics into the freshman Coalition environment. Graphical analysis techniques introduce CADD (Computer Aided Design and Drafting) to the student in a manner that reaches graphical fundamentals and at the same time is relevant to topics addressed in other course work. Examples include: graphical solutions to vectors are used to introduce the concept of coordinate systems and scale; and traditional topics in descriptive geometry have been replaced with an introduction to 3D model development. Another area where graphics provides a valuable interface is in developing communication skills. Integrated technical reports, produced by student engineering design teams, include technical content (graded by science, mathematics, and engineering faculty) and are submitted to English.
A fast technique for identifying zerotrees in the EZW algorithm
Authors: J. M. Shapiro
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The embedded zerotree wavelet (EZW) algorithm has become a popular benchmark for image compression algorithms. The current paper presents a fast technique for identifying zerotrees for all dominant passes in the encoder prior to encoding. The key is initializing a data structure called a zerotree map with the largest power of two smaller than a given coefficient, and then completing the zerotree map by bitwise-ORing the values of potential parents with those of their children. This simple operation can be performed in parallel with the wavelet transform operation and thus is efficient for both hardware and software implementations.
Working Group Report on Semantic Technologies in Collaborative Applications
Authors: Thomas Riechert, Ernesto Jimenez Ruiz, Ivan Cantador, Michael Engler, Danius Michaelides, Manfred Bortenschlager, Robert Tolksdorf
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

The 1st International Workshop on Semantic Technologies in Collaborative Applications STICA 06 brought together researchers in the field of semantics-enabled collaboration. The presentations covered various aspects of the field and showed clear indications for future collaborations.
Bridging and Persistence in Sustained, Collaborative Problem Solving Online
Authors: Johann W. Sarmiento, Gerry Stahl
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The Virtual Math Teams (VMT) project investigates the innovative use of online collaborative environments to support effective mathematical problem-solving by small groups of learners in an online community. A key research issue for us is to understand how team interactions evolve over time and how to support them effectively. As designers, we expect the persistent records of the teams' interactions provided in the VMT environment to contribute to the sustainability of the teams' knowledge work. Our analysis of data collected from distributed virtual teams working on open-ended mathematical tasks across multiple sessions shows the situated usage of such persistent artifacts. In particular, we observe a series of "bridging" methods used to co-construct mathematical knowledge over time, evolve a sense of collectivity, and interlink the online environment with other interaction spaces. We propose that bridging, the purposeful crossing of interactional boundaries, is a consequential and often unsupported aspect of the collaborative user experience.
Provably secure authenticated group Diffie-Hellman key exchange
Authors: Emmanuel Bresson, Olivier Chevassut, David Pointcheval
Venue: ACM Transactions on Information and System Security (TISSEC) (2007)

Authenticated key-exchange protocols allow two participants A and B, communicating over a public network and each holding an authentication means to exchange a shared secret value. Methods designed to deal with this cryptographic problem ensure A (resp. B) that no other participants aside from B (resp. A) can learn any information about the agreed value and often also ensure A and B that their respective partner has actually computed this value. A natural extension to this cryptographic method is to consider a pool of participants exchanging a shared secret value and to provide a formal treatment for it. Starting from the famous two-party Diffie--Hellman (DH) key-exchange protocol and from its authenticated variants, security experts have extended it to the multiparty setting for over a decade and, in the past few years, completed a formal analysis in the framework of modern cryptography. The present paper synthesizes this body of work on the provably-secure authenticated group DH key exchange.
Polynomial classifier techniques for speaker verification
Authors: W. M. Campbell
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

Modern speaker verification applications require high accuracy at low complexity. We propose the use of a polynomial-based classifier to achieve this objective. We demonstrate a new combination of techniques which makes polynomial classification accurate and powerful for speaker verification. We show that discriminative training of polynomial classifiers can be performed on large data sets. A prior probability compensation method is detailed which increases accuracy and normalizes the output score range. Results are given for the application of the new methods to YOHO.
Optimal least-squares design of pipelined recursive filters in the time-domain
Authors: S. Pokala
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Look-ahead pipelined recursive filters are primarily obtained from a given transfer function. However, Chien-Piao Lan and Chien Wei Jen (1994) designed the pipelined filters directly from the time-domain specifications using the modified least-squares approximation. In this paper, we present an algorithm for optimal least-squares estimation of the coefficients of recursive filters in look-ahead pipelined form. The method minimizes the norm of the true fitting error between the prescribed and the estimated impulse responses by first theoretically decoupling the numerator and denominator estimation into two separate subproblems. A simple algorithm is then presented for iterative estimation of the denominator, whereupon the numerator can be obtained in a single step. Some examples and comparison with an existing method are provided to illustrate the proposed algorithm.
The Design of Virtual Self-timed Block for Activity Communication in SOC
Authors: Yuan Chen, Fei Xia, Delong Shang, Alex Yakovlev
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

In this paper we present the architecture for virtual self-timed blocks. Being globally asynchronous locally synchronous (GALS) and lazy reactive processing units, such blocks target multi-processing on-chip systems where power consumption is an important factor. The architecture provides a hardware foundation which transparently supports the systematic organization of application-level activities (processes) and the efficient use of system resources. It further facilitates the seamless integration of IP cores into systems by enhancing the GALS paradigm and protecting clocked IP cores from the temporal nondeterminism in their environments. This work includes the basic design of the virtual self-timed block architecture, Matlab models of the important components involved, and demonstrative analyses in Matlab.
A Pattern Matching Approach for the Estimation of Alignment Between Any Two Given DNA Sequences
Authors: K. Basu, N. Sriraam, R. J. Richard
Venue: Journal of Medical Systems (2007)

For a given DNA sequence, it is well known that pair wise alignment schemes are used to determine the similarity with the DNA sequences available in the databanks. The efficiency of the alignment decides the type of amino acids and its corresponding proteins. In order to evaluate the given DNA sequence for its proteomic identity, a pattern matching approach is proposed in this paper. A block based semi-global alignment scheme is introduced to determine the similarity between the DNA sequences (known and given). The two DNA sequences are divided into blocks of equal length and alignment is performed which minimizes the computational complexity. The efficiency of the alignment scheme is evaluated using the parameter, percentage of similarity (POS). Four essential DNA version of the amino acids that emphasize the importance of proteomic functionalities are chosen as patterns and matching is performed with the known and given DNA sequences to determine the similarity between them. The ratio of amino acid counts between the two sequences is estimated and the results are compared with that of the POS value. It is found from the experimental results that higher the POS value and the pattern matching higher are the similarity between the two DNA sequences. The optimal block is also identified based on the POS value and amino acids count.
Cyclically orthogonal subsets of Walsh functions
Authors: Yongxiang Xia, Pu Li, Xiuming Shan, Yong Ren
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper studies the correlation properties of Walsh functions. It is found that Walsh functions generated by a Hadamard matrix could be divided into several cyclically orthogonal subsets. An approach to obtain such subsets is proposed as a theorem and is proved through the mathematical induction. The application of the cyclically orthogonal subsets of Walsh functions to DS-CDMA communications is then discussed.
Distributed Web caching with incremental update
Authors: T. T. Tay, Zhang Yong
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper proposes a peer-distributed Web caching scheme with incremental update and delivery. In the scheme, each computer (client) within a physical cluster is assigned an additional Web caching function. The server generates patches whenever there are updates of Web objects by coding the differences between the stale and the fresh Web objects. The protocol allows a client requesting an updated object to retrieve the patch from the original server and the patchable stale file from its local or peer cache storage. The stale file together with the patch then regenerates the fresh file for the client.
Image Enhancement using Triple Energy Well A Novel approach
Authors: K Srikantamurthy, S Natarajan, U P. Narendra
Venue: Proceedings of the Geometric Modelling and Imaging (2007)

In this paper we propose a novel and simple technique based on triple energy well for image enhancement. In our approach the noise and the edges are considered as separate entities and it is evident that the gradient plot for noises is much lower than that of edges. The triple energy well plot is three U's joined together and this plot is applied as a filter to enhance the image and denoising the content.
LTL Model Checking for Security Protocols
Authors: Alessandro Armando, Roberto Carbone, Luca Compagna
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

Most model checking techniques for security protocols make a number of simplifying assumptions on the protocol and/or on its execution environment that prevent their applicability in some important cases. For instance, most techniques assume that communication between honest principals is controlled by a Dolev-Yao intruder, i.e. a malicious agent capable to overhear, divert, and fake messages. Yet we might be interested in establishing the security of a protocol that relies on a less unsecure channel (e.g. a confidential channel provided by some other protocol sitting lower in the protocol stack). In this paper we propose a general model for security protocols based on the set-rewriting formalism that, coupled with the use of LTL, allows for the specification of assumptions on principals and communication channels as well as complex security properties that are normally not handled by state-of-the-art protocol analysers. By using our approach we have been able to formalise all the assumptions required by the ASW protocol for optimistic fair exchange as well as some of its security properties. Besides the previously reported attacks on the protocol, we report a new attack on a patched version of the protocol.
More algorithms for all-pairs shortest paths in weighted graphs
Authors: Timothy M. Chan
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

In the first part of the paper, we reexamine the all-pairsshortest paths (APSP) problem and present a newalgorithm with running time approaching O(n3/log2n), which improves all known algorithms for general real-weighted dense graphs andis perhaps close to the best result possible without using fast matrix multiplication, modulo a few log log n factors. In the second part of the paper, we use fast matrix multiplication to obtain truly subcubic APSP algorithms for a large class of "geometrically weighted" graphs, where the weight of an edge is a function of the coordinates of its vertices. For example, for graphs embedded in Euclidean space of a constant dimension d, we obtain a time bound near O(n3-(3-Ω)/(2d+4)), where Ω < 2.376 ; in two dimensions, this is O(n2.922). Our framework greatly extends the previously considered case of small-integer-weighted graphs, and incidentally also yields the first truly subcubic result (near O(n3-(3-Ω)/4)=O(n2.844) time) forAPSP in real-vertex-weighted graphs, as well as an improved result (near O(n(3+Ω)/2)=O(n2.688) time) for the all-pairs lightest shortest path problem for small-integer-weighted graphs.
Recommender Systems Based on an Active Data Warehouse with Text Documents
Authors: Carsten Felden, Peter Chamoni
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In everyday life one has to take a variety of decisions. So there is a need for recommendation which information may be relevant and which is rather unimportant to support decision making. Frequently we find recommendation systems to assist clients in online-shops and other internet environments. The objective of these systems is the implementation of user-friendly interfaces with a high degree of personalization and efficient decision support. This paper evaluates several machine-learning techniques for recommendation systems which are suitable to find appropriate decision-relevant text documents like product descriptions or test reports. We propose recommendation systems which are based on an active data warehouse where we link adaptive user profiles and textual product descriptions.
Soft error rate analysis for sequential circuits
Authors: Natasa Miskov-Zivanov, Diana Marculescu
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Due to reduction in device feature size and supply voltage, the sensitivity to radiation induced transient faults (soft errors) of digital systems increases dramatically. Intensive research has been done so far in modeling and analysis of combinational circuit susceptibility to soft errors, while sequential circuits have received much less attention. In this paper, we present an approach for evaluating the susceptibility of sequential circuits to soft errors. The proposed approach uses symbolic modeling based on BDDs/ADDs and probabilistic sequential circuit analysis. The SER evaluation is demonstrated by the set of experimental results, which show that, for most of the benchmarks used, the SER decreases well below a given threshold (10-7 FIT) within ten clock cycles after the hit. The results obtained with the proposed symbolic framework are within 4% average error and up to 11000X faster when compared to HSPICE detailed circuit simulation.
Operating system protection for fine-grained programs
Authors: Trent Jaeger, Jochen Liedtke, Nayeem Islam
Venue: Proceedings of the 7th conference on USENIX Security Symposium - Volume 7 (1998)

We present an operating system-level security model for controlling fine-grained programs, such as downloaded executable content, and compare this security model's implementation to that of language-based security models. Language-based security has well-known limitations, such as the lack of complete mediation (e.g., for compiled programs or race condition attacks) and faulty self-protection (effective security is unproven). Operating system-level models are capable of complete mediation and self-protection, but some researchers argue that operating system-level security models are unlikely to supplant such language-based models because they lack portability and performance. In this paper, we detail an operating system-level security model built on the Lava Nucleus, a minimal, fast µ-kernel operating system. We show how it can enforce security requirements for fine-grained programs and show that its performance overhead (with the additional security) can be virtually negligible when compared to language-based models. Given the sufficient performance and security, the portability issue should become moot because other vendors will have to meet the higher security and performance expectations of their customers.
Graphic approach to combinatorial optimization
Authors: A. A. Lazarev
Venue: Automation and Remote Control (2007)

Consideration was given to a graphic realization of the method of dynamic programming. Its concept was demonstrated by the examples of the partition and knapsack problems. The proposed method was compared with the existing algorithms to solve these problems.
The performance of synchronous parallel polynomial root extraction on a ring multicomputer
Authors: Hamid Sarbazi-Azad
Venue: Cluster Computing (2007)

In this paper, a parallel algorithm for computing the roots of a given polynomial of degree n on a ring of processors is proposed. The algorithm implements Durand---Kerner's method and consists of two phases: initialisation, and iteration. In the initialisation phase all the necessary preparation steps are realised to start the parallel computation. It includes register initialisation and initial approximation of roots requiring 3n¿2 communications, 2 exponentiation, one multiplications, 6 divisions, and 4n¿3 additions. In the iteration phase, these initial approximated roots are corrected repeatedly and converge to their accurate values. The iteration phase is composed of some iteration steps, each consisting of 3n communications, 4n+3 additions, 3n+1 multiplications, and one division.