ppxscal/embedding_network huggingface dataset:
Making connections through media relations [engineering college marketing]
Authors: C. Garcia
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

This is the fourth in a series of six companion papers that address the marketing of the College of Engineering at the University of Arkansas, USA. While valuable as an independent resource, the content of this document should be considered within the context of all six papers. An effective media relations program requires trust and credibility, both internally and externally. A public information officer can craft a very effective media relations program that will target a specific audience to meet the goals of the institution. A wide variety of traditional and electronic tools are available to support the media relations effort, but in the end it is all about building relationships with faculty and media representatives. 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
Artificial life approach for continuous optimisation of non-stationary dynamical systems
Authors: M. Annunziato, C. Bruni, M. Lucchetti, S. Pizzuti
Venue: Integrated Computer-Aided Engineering (2003)

In this paper, we develop an intelligent system to approach dynamical optimisation problems emerging in control of complex systems. In particular our proposal is to exploit the adaptivity of an artificial life (alife) environment in order to achieve "not control rules but autonomous structures able to dynamically adapt and to generate optimised-control rules". The basic features of the proposed approach are: no intensive modelling (continuous learning directly from measurements) and capability to follow the system evolution (adaptation to environmental changes). The suggested methodology has been tested on an energy regulation problem deriving from a classical testbed in dynamical systems experimentations: the Chua's circuit. We supposed not to know the system dynamics and to be able to act only on a subset of control parameters, letting the others vary in time in a random discrete way. We let the optimisation process searching for the new best value of performance, whenever a drop due to changes in fitness landscape occurred. We present the most important results showing the effectiveness of the proposed approach in adapting to environmental non-stationary changes by recovering the optimal value of process performance.
Parallel Speculative Computation of Simulated Annealing
Authors: Andrew Sohn
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

Simulated annealing is known to be highly sequential due to loop-carried dependencies. This report presents a new approach to parallel simulated annealing, called generalized speculative computation (GSC). We use an n-ary speculative tree and loop indices to execute n iterations in parallel on n processors while maintaining the same decision sequence as sequential simulated annealing. To verify the performance of GSC, we implement 100- to 500-city Traveling Salesman Problems on the AP1000 massively parallel multiprocessor. Execution results demonstrate that the GSC approach can indeed be an effective method for simulated annealing. We obtain over 20-fold speedup for the initial temperature of 0.1 and 11-fold speedup for the initial temperature of 10, all on 100 processors.
Fabrication of silicon-on-insulator MEM resonators with deep sub-micron transduction gaps
Authors: Nicoleta Diana Badila Ciressan, Cyrille Hibert, Marco Mazza, Adrian M. Ionescu
Venue: Microsystem Technologies (2007)

The paper proposes and validates a low-cost technological process for the realization of mono-crystalline micro-electro-mechanical (MEM) resonators with deep sub-micron transduction gaps, on silicon-on-insulator (SOI) substrates. The MEM resonators are designed to work as bulk lateral resonators (BLR) in which the resonance of a suspended mass is excited and detected by lateral electrodes. For MEM BLRs, nano-scaled gaps (<200&#x00a0;nm) are essential to reduce the motional resistance in the order of few k&#x03a9; as well as to avoid the use of large DC applied voltages. Only standard optical lithography with 1&#x00a0;&#x03bc;m resolution and IC-compatible processing steps are employed to obtain 100&#x2013;200&#x00a0;nm wide gaps with very high aspect-ratios of more than [40:1], allowing the fabrication of high Q resonators for MHz to GHz operating frequency range.
An algorithm to generate all upper boundary points for (d,B) in terms of minimal cuts
Authors: Yi-Kuei Lin
Venue: Computers Mathematics with Applications (2007)

This paper discusses a stochastic-flow network from single-commodity case to multicommodity case. We propose a performance index, namely the probability that the upper bound of the system capacity is a given vector subject to the budget constraint, to evaluate the quality level for such a network. A simple approach based on minimal cuts is presented to generate the all upper boundary points for the demand d subject to the budget B in order to evaluate the performance index.
Partial prefetch for faster surfing in composite hypermedia
Authors: Javed I. Khan, Qingping Tao
Venue: Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3 (2001)

In this paper we present a prefetch technique, which incorporates a scheme similar to data streaming to minimize the response-lag. Unlike previous all or none techniques, we propose partial prefetch where the size of the lead segment is computed optimally so that only a minimum but sufficient amount of data is prefetched and buffered. The remaining segment is fetched if and only when the media is traversed. Thus, it delivers content without any increase in perceived response delay, and at the same time drastically minimizes unnecessary pre-load. The paper presents the scheme in the context of surfing in composite multimedia documents. It presents the technique and optimization scheme used for stream segmentation backed by analytical model and statistical simulation. We report remarkable increase in the responsiveness of web systems by a factor of 2-15 based on the specific situation.
Phase self-calibrated scheme for zero-IF receiver
Authors: Shuilong Huang, Zhihua Wang
Venue: Analog Integrated Circuits and Signal Processing (2007)

A new phase self-calibrated scheme maintains the quadrature is proposed in the letter, which mainly includes quadrature phase detector (QPD), charge pump, comparator, controller and variable delay buffer (VDB) etc. The primary idea behind the scheme is that the quadrature phase error is converted to the voltage variation on the capacitor, and then the voltage variation drives the controller to tune the VDB to the proper control word. The phase calibration is digitally controlled and considers the mismatch effect of charge pump, removing the disadvantage of conventional analog calibration circuit whose performance is sensitive to process and temperature variations and aging. It is shown that the two VDBs have an 8°quadrature phase shift tuning range, and an 8 mA current at 1.7 HGz, and the calibration process takes less than 160 μs.
Topology-aware overlay path probing
Authors: Chiping Tang, Philip K. McKinley
Venue: Computer Communications (2007)

Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as O(n^2), which is prohibitive in large-scale overlay networks. Several methods have been proposed to reduce probing overhead, although at a cost in terms of probing completeness. In this paper, an orthogonal solution is proposed that trades probing overhead for estimation accuracy in sparse networks such as the Internet. The proposed solution uses network-level path composition information (for example, as provided by a topology server) to infer path quality without full-scale probing. The inference metrics include latency, loss rate and available bandwidth. This approach is used to design several probing algorithms, which are evaluated through extensive simulation. The results show that the proposed method can reduce probing overhead significantly while providing bounded quality estimations for all of the nx(n-1) overlay paths. The solution is well suited to medium-scale overlay networks in the Internet. In other environments, it can be combined with extant probing algorithms to further improve performance.
Distributed filaments: efficient fine-grain parallelism on a cluster of workstations
Authors: Vincent W. Freeh, David K. Lowenthal, Gregory R. Andrews
Venue: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation (1994)

A fine-grain parallel program is one in which processes are typically small ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situations such as iterative grid computations recursive fork/join programs the bodies of parallel FOR loops and the implicit parallelism in functional or dataflow languages. It is useful both to describe massively parallel computations and as a target for code generation by compilers. However fine-grain parallelism has long been thought to be inefficient due to the overheads of process creation context switching, and synchronization. This paper describes a software kernel. Distributed Filaments (DF) that implements fine-grain parallelism both portably and efficiently on a workstation cluster DF runs on existing off-the-shelf hardware and software. It has a simple interface so it is easy to use. DF achieves e ciency by using stateless threads on each node overlapping communication and computation, employing a new reliable datagram communication protocol and automatically balancing the work generated by fork/join computations.
A new segmentation method for MRI images of the shoulder joint
Authors: Nhat Tan Nguyen, Denis Laurendeau, Alexandra Branzan-Albu
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

This paper presents an integrated region-based and gradient-based supervised method for segmentation of a patient magnetic resonance images (MRI) of the shoulder joint. The method is noninvasive, anatomy-based and requires only simple user interaction. It is generic and easily customizable for a variety of routine clinical uses in orthopedic surgery.
An architecture for a next-generation holistic e-recruiting system
Authors: In Lee
Venue: Communications of the ACM (2007)

Online recruiting has revolutionized the way businesses worldwide hire employees. The next step is to seamlessly integrate existing systems to create a comprehensive---and complex---corporate career center.
Computing super-irreducible forms of systems of linear differential equations via moser-reduction: a new approach
Authors: Moulay A. Barkatou, Eckhard Pflügel
Venue: Proceedings of the 2007 international symposium on Symbolic and algebraic computation (2007)

The notion of irreducible forms of systems of linear differential equations as defined by Moser [14 ] and its generalisation, the super-irreducible forms introduced by Hilali/Wazner in [9 ] are important concepts in the context of the symbolic resolution of systems of linear differential equations [3,15,16 ]. In this paper, we give a new algorithm for computing, given an arbitrary linear differential system with formal power series coefficients as input, an equivalent system which is super-irreducible. Our algorithm is optimal in the sense that it computes transformation matrices which obtain a maximal reduction of rank in each step of the algorithm. This distinguishes it from the algorithms in [9,14,2] and generalises [7].
Incorporating confidence measures in the Dutch train timetable information system developed in the ARISE project
Authors: G. Bouwman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

The use of confidence measures (CMs) in spoken dialog system (SDS) applications to suppress the number of verification turns for 'reliably correctly recognised utterances' can greatly reduce average dialog length which enhances usability and increases user satisfaction. This paper gives a clear review of the method of CM assessment, which was presented by Boves, Herberts and Russel (see Proceedings of the IEEE Third Workshop Interactive Voice Technology for Telecommunications Applications, Granada, Spain, p.89-92, 1996). It proceeds by demonstrating how the Dutch ARISE (Automatic Railways Information Systems in Europe) SDS was equipped with this technology and shows in deep detail how the parameters involved are to be optimised. The evaluation reveals and explains a typical behaviour of this method with train timetable information-alike systems. This results in a set of conclusions that were not foreseen when the method was first developed for a directory information system. The paper ends with an outlook for solutions in new research directions.
Operating system integrated energy aware scratchpad allocation strategies for multiprocess applications
Authors: Robert Pyka, Christoph Faßbach, Manish Verma, Heiko Falk, Peter Marwedel
Venue: Proceedingsof the 10th international workshop on Software compilers for embedded systems (2007)

Various scratchpad allocation strategies have been developed in the past. Most of them target the reduction of energy consumption. These approaches share the necessity of having direct access to the scratchpad memory. In earlier embedded systems this was always true, but with the increasing complexity of tasks systems have to perform, an additional operating system layer between the hardware and the application is becoming mandatory. This paper presents an approach to integrate a scratchpad memory manager into the operating system. The goal is to minimize energy consumption. In contrast to previous work, compile time knowledge about the application's behavior is taken into account. A set of fast heuristic allocation methods is proposed in this paper. An in-depth study and comparison of achieved energy savings and cycle reductions was performed. The results show that even in the highly dynamic environment of an operating system equipped embedded system, up to 83% energy consumption reduction can be achieved.
Regression on manifolds using kernel dimension reduction
Authors: Jens Nilsson, Fei Sha, Michael I. Jordan
Venue: Proceedings of the 24th international conference on Machine learning (2007)

We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads of research. On the one hand, the literature on sufficient dimension reduction has focused on methods for finding the best linear subspace for nonlinear regression; we extend this to manifolds. On the other hand, the literature on manifold learning has focused on unsupervised dimensionality reduction; we extend this to the supervised setting. Our approach to solving the problem involves combining the machinery of kernel dimension reduction with Laplacian eigenmaps. Specifically, we optimize cross-covariance operators in kernel feature spaces that are induced by the normalized graph Laplacian. The result is a highly flexible method in which no strong assumptions are made on the regression function or on the distribution of the covariates. We illustrate our methodology on the analysis of global temperature data and image manifolds.
Toward a Calculus of Confidence
Authors: Christopher Scaffidi, Mary Shaw
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Programmers, and end-user programmers in particular, often have difficulty evaluating software, data, and communication components for reuse in new software systems, which effectively reduces the value programmers derive from those components. End-user programmers are especially ill equipped to exercise the customary high-ceremony means of evaluating software quality. We seek effective ways to use low-ceremony sources of evidence, such as online reviews and reputation data, to make components' quality attributes easier to establish, thereby facilitating more effective selection of components for reuse. Achieving this will require identifying sources of low-ceremony evidence, designing the meta-information required to track the differing sources and levels of credibility of various sources of evidence, and developing a method for combining pieces of disparate information into overall estimates of component value.
Locating thematic pinpoints in narrative texts with short phrases: a test study on Don Quixote
Authors: Jie Deng, Richard Furuta, Eduardo Urbina
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Traditional implementations provide only limited assistance for locating the information in narrative texts relevant to a certain point of interest. We are investigating providing a "reading wheel" for such purposes. The first step of the bigger picture, as inspired by the editorial compilation of a textbook's index, is an attempt to locate thematically coherent sentences to a given short phrase. In this paper, we propose a two-step methodology to increase the search performance and examine its effectiveness in a test study. We describe the experimental setup and report on the quantitative evaluation of the techniques involved.
Fuzzy modelling through logic optimization
Authors: A. F. Gobi, W. Pedrycz
Venue: International Journal of Approximate Reasoning (2007)

This study proposes a new logic-driven approach to the development of fuzzy models. We introduce a two-phase design process realizing adaptive logic processing in the form of structural and parametric optimization. By recognizing the fundamental links between binary (two-valued) and fuzzy (multi-valued) logic, effective structural learning is achieved through the use of well-established methods of Boolean minimization encountered in digital systems. This blueprint structure is then refined by adjusting connections of fuzzy neurons, helping to capture the numeric details of the target system's behavior. The introduced structure along with the learning mechanisms helps achieve high accuracy and interpretability (transparency) of the resulting model.
Time-sharing architectures for FIR filter structures
Authors: S. R. Meier
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Due to the still increasing gap between high clock rates which are technically feasible and essentially fixed sampling rates in many application domains time-sharing architectures are increasingly important. However, an efficient utilization of silicon resources cannot be achieved by a simple top-down approach for the mapping of sequential operations onto the same hardware. Rather the local topology of circuit design and layout has to be considered in order to maximize efficiency. Therefore modified bitplane architectures which provide exceptionally efficient silicon utilization due to the small synchronization overhead are used as a starting point. Several alternative time-sharing approaches have been elaborated in order to explore the possible choices for an adaptation to system requirements. A quantitative comparison for the most attractive architectures is provided which shows to what extent the advantages of modified bitplane architectures can be maintained. A typical example of a complex FIR filter serves as an illustration of the overhead of time-sharing architectures.
Modelling of Tram-Track Interaction
Authors: Stjepan Lakusic, Damir Lazarevic
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

The paper deals with numerical model of a tram moving on the track. The rail is modelled as elastically supported continuous beam with lumped masses. A vehicle is approximated as a discrete system consisting of three rigid masses connected with linear elastic springs. Dissipation mechanisms in the system are modelled with the linear dashpots. Two basic assumptions that are used are: a) the Euler-Bernoulli beam theory and b) the separation of the wheel from the rail is not permitted. The system of differential equations of motion is solved by an implicit version of step by step method based on the direct integration technique. The algorithm is conceived on the first order predictor -- (re) corrector method. The contact condition is modelled by the force method. Results of the calculations are compared with the results of measurement on the tram track. Numerical predictions for displacements and accelerations are in good agreement with the experimental findings.
Incorporating student peer review and feedback into the assessment process
Authors: J. McGourty
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

The paper provides a detailed discussion of the design, application, and results of a computer-based approach used to solicit student self and peer assessment and feedback on nine learning outcomes linked to ABET 2000. Several issues are addressed including: the efficacy of student self and peer review, correlation with faculty ratings, faculty and student acceptance, and process management.
Face refinement through a gradient descent alignment approach
Authors: Simon Lucey, Iain Matthews
Venue: Proceedings of the HCSNet workshop on Use of vision in human-computer interaction - Volume 56 (2006)

The accurate alignment of faces is essential to almost all automatic tasks involving face analysis. A common paradigm employed for this task is to exhaustively evaluate a face template/classifier across a discrete set of alignments (typically translation and scale). This strategy, provided the template/classifier has been trained appropriately, can give one a reliable but "rough" estimate of where the face is actually located. However, this estimate is often too poor to be of use in most face analysis applications (e.g. face recognition, audio-visual speech recognition, expression recognition, etc.). In this paper we present an approach that is able to refine this initial rough alignment using a gradient descent approach, so as to gain adequate alignment. Specifically, we propose an efficient algorithm which we refer to as the sequential algorithm, which is able to obtain a good balance between alignment accuracy and computational efficiency. Experiments are conducted on frontal and non-frontal faces.
Visuo-Haptic Systems: Half-Mirrors Considered Harmful
Authors: Christian Sandor, Shinji Uchiyama, Hiroyuki Yamamoto
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

In recent years, systems that allow users to see and touch virtual objects in the same space (visuo-haptic systems) are being investigated. Most research projects are employing a half-mirror, while few use a video seethrough, head-mounted display (HMD). The work presented in this paper points out advantages of the HMDbased approach. First, we present an experiment that analyzes human performance in a target acquisition task. We have compared a half-mirror system with an HMD system. Our main finding is, that a half-mirror significantly reduces performance. Second, we present an HMDbased painting application, which introduces new interaction techniques that could not be implemented with a halfmirror display. We believe that our findings could inspire other researchers, employing a half-mirror, to reconsider their approach.