ppxscal/embedding_network huggingface dataset:
Aggregating algorithms in high dimensional data classification
Authors: Hongyu Zhao
Venue:  (2006)

With the improvements in computer performance and innovations in biological technology, a huge amount of genetic and protein information relevant to diseases can be obtained and recorded rather easily. Analyzing this data however is difficult due to its high dimensionality and the existence of many redundant or noisy features. Many methods have been used, aggregating algorithms have been among the most promising for tackling high dimensional data classification. The most widely used is the Random Forests algorithm. This method is especially attractive because of its prediction accuracy and computational efficiency compared to other tree based methods. Interestingly, despite its wide use, few theoretical studies investigating the factors that may impact the performance of Random Forests, including the number of informative and noisy features, the sample size, and the number of randomly selected features at each node split, have been reported. In this dissertation I take an initial step to analyze the Random Forests algorithm by considering a two-class classification problem where all the features are normally distributed within a class and a stump-tree classifier is used as the base learner. My analysis shows that the random feature selection improves the overall classification accuracy by adaptively assigning voting weights to the weak classifiers according to their performances on the training set. But the adjustment of the weights induced by changing the random selected subset size is very limited. I also claim that bootstrapping original training set enables a larger variety of possible weak classifiers being generated. But the perturbation introduced by bootstrap may deviate from the underlying true distribution of the samples and result in deteriorated weak classifiers. My motivation is to find alternative ways to generate a rich ensemble of weak classifiers that can keep original information and generalize well, and to find a better way to assign weights to the weak classifiers according to their performances and correlations. I proposed the weighted random subspace method. In this method, I addressed the optimal weight assignment problem and proposed solutions under both the independence and dependence assumptions among weak classifiers. Finally, I compared various algorithms on gene expression and protein expression data and confirmed that the weight assignment procedure improves prediction accuracy.
The impact of an authentic, student-centered engineering project on student motivation
Authors: R. M. Marra
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The SPIRIT (Student Projects In Rocket Investigative Techniques) project used teaching innovation and flexibility to forge a highly successful and popular two-year project course at Pennsylvania State University. A combination of traditional and non-traditional teaching methods were used to: (1) maintain a base of common knowledge pertaining to the scientific/engineering mission among a highly diverse student population, and (2) allow students to focus on the knowledge and skills of most interest to them. This paper discusses the impact of this course and project on student motivation levels as measured by the Motivated Strategies for Learning Questionnaire (MSLQ) and student focus groups. Initial results show that, even without academic "rewards", SPIRIT students demonstrated a consistently high level of motivation and enthusiasm for the project. In addition, first- and second-year students rated the SPIRIT project more motivating than a comparison course to a statistically significant extent. The impact of these results in terms of future curricular reform is also discussed.
ERP-based, Web-enabled integrated industrial engineering curriculum pilot
Authors: A. Duran
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

This paper presents a pilot under way at the Industrial Engineering School to evaluate the benefits of applying a single Web-enabled ERP (Enterprise Resource Planning) system to facilitate the integration of the contents of eight subjects covering the last three years of the engineering program. Students will run a product line of a fictitious company throughout this period, taking different standpoints (logistics, finance, etc.) depending on the subject involved, while developing an awareness of the relationships among those approaches. Particular attention is paid to the entry barrier posed by the complexity of a real world ERP; several ways to overcome this barrier are explored in the pilot.
Low Dimensional Surface Parameterisation with Applications in Biometrics
Authors: Wei Quan, Bogdan J. Matuszewski, Lik-Kwan Shark, Djamel Ait-Boudaoud
Venue: Proceedings of the International Conference on Medical Information Visualisation - BioMedical Visualisation (2007)

This paper describes initial results from a novel low dimensional surface parameterisation approach based on a modified Iterative Closest Point (ICP) registration process which uses vertex based Principal Component Analysis (PCA) to incorporate a deformable element into registration process. Using this method a 3-D surface is represented by a shape space vector of much smaller dimensionality than the dimensionality of the original data space vector. The proposed method is tested on both simulated 3-D faces with different facial expressions and real face data. It is shown that the proposed surface representation can be potentially used as feature space for a facial expression recognition system.
Design and analysis of pulse-shaped space-time block code based symbol timing recovery algorithms
Authors: Pawel Adam Dmochowski
Venue:  (2006)

A method for the design of low complexity timing error detectors (TEDs) for orthogonal and quasi-orthogonal space-time block coding (OSTBC and QOSTBC) receivers is presented. It is shown that a difference of threshold crossings timing estimate can be obtained for a two-transmit antenna OSTBC receiver in a frequency-flat Rayleigh fading environment. The S-curve of the resulting TED possesses an important property of robustness to channel fading. The results are generalized by the development of a TED design framework for higher order OSTBCs and the derivation of sufficient conditions for a robust difference of threshold crossings timing estimate. The designed detectors inherently depend on the properties of the spacetime block code under consideration. As such, particular OSTBCs can be regarded as self-synchronizing. Analytical expressions for the S-curve, estimation error variance and the signal-to-noise ratio of detectors for arbitrary OSTBCs are obtained. We design and evaluate the properties of a number of timing estimators for some known space-time block codes. Performance results are examined through system simulations, where the timing drift tracking capabilities of the detectors within a timing loop of an OSTBC receiver are investigated. While the theoretical derivations assume a receiver with perfect channel state information and symbol decisions, simulation results include performance for a receiver employing pilot symbol-based channel estimation and data symbol detection.
Text Categorization for Aligning Educational Standards
Authors: Ozgur Yilmazel, Niranjan Balasubramanian, Sarah C. Harwell, Jennifer Bailey, Anne R. Diekema, Elizabeth D. Liddy
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Standard alignment (where standards describing similar concepts are correlated) is a necessary task in providing full access to educational resources. Manual alignment is time consuming and expensive. We propose an automatic alignment system, using machine learning techniques utilizing natural language processing. In this paper we discuss our experiments on text categorization for automatic alignment. We explore the role of relevant vocabulary sets in automatic alignment.
An overview of curriculum module development in semiconductor manufacturing technology
Authors: L. Mowafy
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

There is an urgent demand for usable curricula and courseware in semiconductor manufacturing technology programs at two-year degree granting institutions. In response, Maricopa Advanced Technology Education Center (MATEC) has developed a system for developing competency-based curriculum modules with supporting faculty development materials, and delivering them electronically. 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
Use of a Genetic Algorithm to Identify Source Code Metrics Which Improves Cognitive Complexity Predictive Models
Authors: Rodrigo Vivanco
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

In empirical software engineering predictive models can be used to classify components as overly complex. Such modules could lead to faults, and as such, may be in need of mitigating actions such as refactoring or more exhaustive testing. Source code metrics can be used as input features for a classifier, however, there exist a large number of measures that capture different aspects of coupling, cohesion, inheritance, complexity and size. In a large dimensional feature space some of the metrics may be irrelevant or redundant. Feature selection is the process of identifying a subset of the attributes that improves a classifier's discriminatory performance. This paper presents initial results of a genetic algorithm as a feature subset selection method that enhances a classifier's ability to discover cognitively complex classes that degrade program understanding.
Every Linear Threshold Function has a Low-Weight Approximator
Authors: Rocco A. Servedio
Venue: Computational Complexity (2007)

Given any linear threshold function f on n Boolean variables, we construct a linear threshold function g which disagrees with f on at most an ¿ fraction of inputs and has integer weights each of magnitude at most $${\sqrt{n}\cdot}2^{{\tilde{O}}(1/ \epsilon^{2})}$$ We show that the construction is optimal in terms of its dependence on n by proving a lower bound of $$\Omega(\sqrt{n})$$ on the weights required to approximate a particular linear threshold function. We give two applications. The first is a deterministic algorithm for approximately counting the fraction of satisfying assignments to an instance of the zero-one knapsack problem to within an additive ± ¿. The algorithm runs in time polynomial in n (but exponential in $${1}/{\epsilon^{2}}$$ ). In our second application, we show that any linear threshold function f is specified to within error ¿ by estimates of its Chow parameters (degree 0 and 1 Fourier coefficients) which are accurate to within an additive $$\pm{1}/({n}\cdot 2^{{\tilde{O}}(1/ \epsilon^{2})})$$ . This is the first such accuracy bound which is inverse polynomial in n, and gives the first polynomial bound (in terms of n) on the number of examples required for learning linear threshold functions in the "restricted focus of attention" framework.
On the domino-parity inequalities for the STSP
Authors: Sylvia Boyd, Sally Cockburn, Danielle Vella
Venue: Mathematical Programming: Series A and B (2007)

One method which has been used very successfully for finding optimal and provably good solutions for large instances of the symmetric travelling salesman problem (STSP) is the branch and cut method. This method requires knowledge of classes of useful valid inequalities for the polytope associated with the STSP, as well as efficient separation routines for these classes of inequalities. Recently a new class of valid inequalities called the domino-parity inequalites were introduced for the STSP. An efficient separation routine is known for these constraints if certain conditions are satisfied by the point to be separated. This separation routine has never been implemented or tested. We present several performance enhancements for this separation routine, and discuss our implementation of this improved algorithm. We test our implementation and provide results which we believe demonstrate the practical usefulness of these constraints and the separation routine for the STSP within a branch and cut framework.
Can High Bandwidth and Latency Justify Large Cache Blocks in Scalable Multiprocessors?
Authors: Ricardo Bianchini, Thomas J. LeBlanc
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

An important architectural design decision affecting the performance of coherent caches is the choice of block size. There are two primary factors that influence this choice: the reference behavior of applications and the remote access bandwidth and latency of the machine. Given that we anticipate increases in both network bandwidth and latency (in processor cycles) in scalable shared-memory multiprocessors, the question arises as to what effect these increases will have on the choice of block size. We use analytical modeling and execution-driven simulation of parallel programs on a large-scale shared-memory machine to examine the relationship between cache block size and application performance as a function of remote access bandwidth and latency. We show that even under assumptions of high remote access bandwidth and latency, the best application performance usually results from using cache blocks between S2 and 128 bytes in size. We also show that modifying the program to remove the dominant source of misses may not increase the best performing block size. We conclude that large cache blocks cannot be justified in most realistic scenarios.
Multimedia distance learning without the wait
Authors: S. R. Thampuran
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Web-linked digital video disks provide high-quality interactive multimedia presentations and virtual laboratories with Web-access for timely materials and collaboration. The authors present techniques for presentation, interaction, and assessment. Experimental modules using these techniques have been developed using multimedia systems as content. New assessment methods allow materials to be dynamically modified to satisfy different learner backgrounds and objectives. A new software tool has been developed for gathering user statistics to best adapt the curriculum as well as evaluate the overall learning efficiency across diverse learner populations. The project is being disseminated at the University of Massachusetts, Springfield Technical Community College, Smith College, ENST/Paris and the National Technological University.
Aligning outreach with cognitive development: K-12 initiatives in electrical engineering at the University of Washington
Authors: D. M. Wilson
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

This paper describes K-12 initiatives in electrical engineering at UW in the context of how they are linked to learning skill, motivation levels, and common misconceptions demonstrated by K-12 students at various stages of their development. In depth discussion and detail regarding a particular learning activity (From Vision to Cameras) is described to provide an in-depth look into how we approach, design, and improve our K-12 activities and outreach efforts. It is fairly common for outreach programs, when driven by faculty within engineering, to focus on high school outreach, since the outreach can be targeted specifically to recruiting students to certain areas of engineering and benefits of the outreach can be assessed efficiently over a relatively short time scale. The K-12 initiatives described in this paper however focus on the development of learning skills and outreach activities that are specifically linked to current knowledge regarding learning and growth stages in early elementary (K-3), late elementary (4-5), middle school (6-9) and high school (10-12) grade levels.
Research Agenda for System of Systems Interoperability
Authors: Patricia Oberndorf, Anatol W. Kark
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

This workshop is a key part of the ICCBSS transition and will determine the future focus for the Conference. The necessity for the transition is a reflection of community's recognition that the complexity of the systems and their sizes have grown tremendously, and that, while COTS-based systems are vital in today's business, the hardest part of successful COTS-based development often has little to do with the "C" -"commercial" - in "COTS". The workshop will generate a robust discussion about the challengeswhether technological, organizational, or cultural - for constructing, acquiring,
Merging NT and UNIX filesystem permissions
Authors: Dave Hitz, Bridget Allison, Andrea Borr, Rob Hawley, Mark Muhlestein
Venue: Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2 (1998)

Sharing network data between NT and UNIX systems is becoming increasingly important as NT moves into areas previously serviced entirely by UNIX. One difficulty in sharing data is that the two filesystem security models are quite different. NT file servers use access control lists (ACLs) that allow permissions to be specified for an arbitrary number of users and groups, while UNIX NFS servers use traditional UNIX permissions that provide control only for owner, group, and other. This paper describes an integrated security model in which a single filesystem can contain both files with NT-style ACLs and files with UNIX-style permissions. For native file service requests (NT requests to NT-style files and NFS requests to UNIX-style files) the security model exactly matches an NT or UNIX fileserver. For non-native requests, heuristics allow a reasonable level of access without compromising the security guarantees of the native model.
Would You Run it Here or There? AHS: Automatic Heterogeneous Supercomputing
Authors: H. G. Dietz, W. E. Cohen, B. K. Grant
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Parallel progrm often exhibit strong preferences for different system structrues, and machines with the ideal structures may all be available within a single heterogeneous network.
Seamless formal verification of complex event processing applications
Authors: AnnMarie Ericsson, Paul Pettersson, Mikael Berndtsson, Marco Seiriö
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

Despite proven successful in previous projects, the use of formal methods for enhancing quality of software is still not used in its full potential in industry. We argue that seamless support for formal verification in a high-level specification tool enhances the attractiveness of using a formal approach for increasing software quality. Commercial Complex Event Processing (CEP) engines often have support for modelling, debugging and testing CEP applications. However, the possibility of utilizing formal analysis is not considered. We argue that using a formal approach for verifying a CEP system can be performed without expertise in formal methods. In this paper, a prototype tool REX is presented with support for specifying both CEP systems and correctness properties of the same application in a high-level graphical language. The specified CEP applications are seamlessly transformed into a timed automata representation together with the high-level properties for automatic verification in the model-checker UPPAAL.
Pileus: umbrella type entertainment browser
Authors: Sho Hashimoto, Takashi Matsumoto, Naohito Okude
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Pileus is the Umbrella type Entertainment Browser to interact photos and videos on web services in urban environment, as a platform of interact with small personal entertainment contents in daily life. It was demonstrated at Ubicomp 2006, but current implementation works only indoor environment. In this paper, we describe upgrading system of Pileus in field-testing at city.
Using multiple acoustic feature sets for speech recognition
Authors: András Zolnay, Daniil Kocharov, Ralf Schlüter, Hermann Ney
Venue: Speech Communication (2007)

In this paper, the use of multiple acoustic feature sets for speech recognition is investigated. The combination of both auditory as well as articulatory motivated features is considered. In addition to a voicing feature, we introduce a recently developed articulatory motivated feature, the spectrum derivative feature. Features are combined both directly using linear discriminant analysis (LDA) as well as indirectly on model level using discriminative model combination (DMC). Experimental results are presented for both small- and large-vocabulary tasks. The results show that the accuracy of automatic speech recognition systems can be significantly improved by the combination of auditory and articulatory motivated features. The word error rate is reduced from 1.8% to 1.5% on the SieTill task for German digit string recognition. Consistent improvements in word error rate have been obtained on two large-vocabulary corpora. The word error rate is reduced from 19.1% to 18.4% on the VerbMobil II corpus, a German large-vocabulary conversational speech task, and from 14.1% to 13.5% on the British English part of the European parliament plenary sessions (EPPS) task from the 2005 TC-STAR ASR evaluation campaign.
Performance Evaluation of SIMD Processor Architectures Using Pairwise Multiplier Recoding
Authors: Todd C. Marek, Edward W. Davis
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Research in the area of massively parallel processing with a focus on processor architecture is presented. Multiplication using conventional techniques and a modified multiplier recoding scheme for 2's complement fixed-point multiplication is used to evaluate different SIMD architectures. Recoding is facilitated by a small amount of hardware which can be included at each processor even when the size of the individual processor is small. Performance figures are measured for 20-bit and 32-bit fixed-point multiplies, and for generation of Mandlebrot images using 20 bits and 32 bits of precision. Results indicate that although the 1 bit system has the highest cycle count for individual multiplies, this system also achieves the largest aggregate Mops rate when the systems are given equivalent processing power.
Understanding voltage variations in chip multiprocessors using a distributed power-delivery network
Authors: Meeta S. Gupta, Jarod L. Oatley, Russ Joseph, Gu-Yeon Wei, David M. Brooks
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Recent efforts to address microprocessor power dissipation through aggressive supply voltage scaling and power management require that designers be increasingly cognizant of power supply variations. These variations, primarily due to fast changes in supply current, can be attributed to architectural gating events that reduce power dissipation. In order to study this problem, we propose a fine-grain, parameterizable model for power-delivery networks that allows system designers to study localized, on-chip supply fluctuations in high-performance microprocessors. Using this model, we analyze voltage variations in the context of next-generation chip-multiprocessor (CMP) architectures using both real applications and synthetic current traces. We find that the activity of distinct cores in CMPs present several new design challenges when considering power supply noise, and we describe potentially problematic activity sequences that are unique to CMP architectures.