ppxscal/embedding_network huggingface dataset:
Developing information literacy skills in freshmen engineering technology students
Authors: L. Feldmann
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

With the rapid growth of the information society the ability of technology graduates to be information literate has become critically important. Through the collaboration of a Mechanical Engineering Technology professor and an academic librarian, a project was designed which increased students' information research skills, their awareness of other sources of technical information, and their communication and team building skills. One problem faced by the authors was to develop strategies to integrate these skills into a curriculum that is already very demanding without deleting any of the elements in the current curriculum. A pre-test, post-test, and student comments supported the usefulness of the assignment. This paper will discuss the methods used, desired outcomes, students' experiences and the research results.
Early Computing at the University of Alberta and the Introduction of the LGP-30
Authors: Keith Smillie
Venue: IEEE Annals of the History of Computing (2007)

To re-create the University of Alberta's computing milieu of some 40 years ago, this article surveys the University's computational procedures before the arrival of the first computer and discusses the University's acquisition and use of the LGP-30.
A Metrics Generation Model for Measuring the Control Objectives of Information Systems Audit
Authors: Mathew Nicho, Brian Cusack
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Information Technology governance (ITG) which was a relatively new concept in the late 1990s, has gained importance in the 21st century due to factors namely the collapse of Enron Inc, and the need for a better reporting and financial disclosure system as requested by the US Securities and Exchange Commission chairman in 2001. Subsequent legislations namely the Sarbanes Oxley Act (SOX) in the United States and the Turnbull Guidance in the United Kingdom provided further impetus for the need for ITG. Other factors that prompt companies to give more importance to the management, control and measurement of information systems include the risk associated with information, the investments made by companies into the IT resource and the need to be competitive in the marketplace. All of these factors emphasize the requirement to measure the performance or effectiveness of information systems. The state of performance of various entities, events and process of information systems give a "dashboard approach' vision to management. In this paper a metrics generation model is proposed for generating metrics that can measure the key performance indicators and goals of the control objectives of CoBIT by applying the GQM model..
Light Scattering from Filaments
Authors: Arno Zinke Andreas Weber
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Photo realistic visualization of a huge number of individual filaments like in the case of hair, fur, or knitwear is a challenging task: Explicit rendering approaches for simulating radiance transfer at a filament get totally impracticable with respect to rendering performance and it is also not obvious how to derive efficient scattering functions for different levels of (geometric) abstraction or how to deal with very complex scattering mechanisms. We present a novel uniform formalism for light scattering from filaments in terms of radiance, which we call the Bidirectional Fiber Scattering Distribution Function (BFSDF). We show that previous specialized approaches, which have been developed in the context of hair rendering, can be seen as instances of the BFSDF. Similar to the role of the BSSRDF for surface scattering functions, the BFSDF can be seen as a general approach for light scattering from filaments, which is suitable for deriving approximations in a canonic and systematic way. For the frequent cases of distant light sources and observers, we deduce an efficient far field approximation (Bidirectional Curve Scattering Distribution Function, BCSDF). We show that on the basis of the BFSDF, parameters for common rendering techniques can be estimated in a non-ad-hoc, but physically-based way.
Learning to communicate in a decentralized environment
Authors: Claudia V. Goldman, Martin Allen, Shlomo Zilberstein
Venue: Autonomous Agents and Multi-Agent Systems (2007)

Learning to communicate is an emerging challenge in AI research. It is known that agents interacting in decentralized, stochastic environments can benefit from exchanging information. Multi-agent planning generally assumes that agents share a common means of communication; however, in building robust distributed systems it is important to address potential miscoordination resulting from misinterpretation of messages exchanged. This paper lays foundations for studying this problem, examining its properties analytically and empirically in a decision-theoretic context. We establish a formal framework for the problem, and identify a collection of necessary and sufficient properties for decision problems that allow agents to employ probabilistic updating schemes in order to learn how to interpret what others are communicating. Solving the problem optimally is often intractable, but our approach enables agents using different languages to converge upon coordination over time. Our experimental work establishes how these methods perform when applied to problems of varying complexity.
Positive and dead core solutions of singular Dirichlet boundary value problems with φ-Laplacian
Authors: Ravi P. Agarwal, Donal O'Regan, Svatoslav Stank
Venue: Computers Mathematics with Applications (2007)

The paper discusses the existence of positive solutions, dead core solutions and pseudodead core solutions of the singular Dirichlet boundary value problem (@f(u^'))^'=@l[f(t,u,u^')+h(t,u,u^')], u(0)=u(T)=A. Here @l is the positive parameter, A>0, f is singular at the value 0 of its first phase variable and h may be singular at the value 0 of its second phase variable.
Rational and radical fixed point functions for the eigenvalue problem and polynomials
Authors: J. A. K. Hasan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

The derivation and implementation of many algorithms in signal/image processing and control involve some form of polynomial root-finding and/or matrix eigendecomposition. In this paper, higher order fixed point functions in rational and/or radical forms are developed. This set of iterations can be considered as extensions of known methods such as the Newton, Lagurre and Halley methods and can be applied to compute all zeros of a polynomial as well as all eigenvalues of a complex matrix. One of the main features of the proposed algorithms is that they could have any predetermined rate of convergence regardless of the multiplicity of the zeros or eigenvalues. Additionally, eigenvalues and eigenvectors are computed using fast matrix inverse free algorithms which are based on the QR factorization.
A comparative study on multivariate mathematical morphology
Authors: E. Aptoula, S. Lefèvre
Venue: Pattern Recognition (2007)

The successful application of univariate morphological operators on several domains, along with the increasing need for processing the plethora of available multivalued images, have been the main motives behind the efforts concentrated on extending the mathematical morphology framework to multivariate data. The few theoretical requirements of this extension, consisting primarily of a ranking scheme as well as extrema operators for vectorial data, have led to numerous suggestions with diverse properties. However, none of them has yet been widely accepted. Furthermore, the comparison research work in the current literature, evaluating the results obtained from these approaches, is either outdated or limited to a particular application domain. In this paper, a comprehensive review of the proposed multivariate morphological frameworks is provided. In particular, they are examined mainly with respect to their data ordering methodologies. Additionally, the results of a brief series of illustrative application oriented tests of selected vector orderings on colour and multispectral remote sensing data are also discussed.
Linear prediction for bandpass signals based on nonuniform past samples
Authors: D. H. Mugler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper concerns linear prediction of the value of a bandpass signal containing one or more passbands from a finite set of its past samples. The method of choosing prediction coefficients involves the eigenvector corresponding to the smallest eigenvalue of a matrix dependent on a function which is the Fourier transform of the set of intervals making up the passband. The method is developed for a set of arbitrary past samples and applied here to a set of "interlaced" samples that are nonuniform but periodic. The method applies to finite energy signals as well as to bandpass signals of polynomial growth, which connects to the theory of generalized functions. Computational examples are given of prediction coefficient values and of signal predictions.
A DSP active filter for power conditioning
Authors: A. Unsal
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This paper presents a DSP controlled active filter for power conditioning, The active filter is designed to cancel lower order harmonics generated by nonlinear loads using a series resonant LC tank tuned to a high frequency along with a pulse-width modulation (PWM) rectifier topology. The PWM control of the active filter allows for independent control of lower order harmonics, both in amplitude and in phase, to efficiently cancel load generated harmonics for power quality improvement. The active filter control algorithm is simulated in Matlab and the harmonic cancellation process is verified through PSpice.
Testing in the year 2020
Authors: Rajesh Galivanche, Rohit Kapur, Antonio Rubio
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Testing today of a several hundred million transistor System-on-Chip with analog, RF blocks, many processor cores and tens of memories is a huge task. What will test technology be like in year 2020 with hundreds of billions of transistors on a single chip? Can we get there with tweaks to today's technology? While the exact nature of the circuit styles, architectural innovations and product innovations in year 2020 are highly speculative at this point, we examine the impact of likely design and process technology trends on testing methods.
A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
Authors: Neeraj Mittal, Prajwal K. Mohan
Venue: Journal of Parallel and Distributed Computing (2007)

In the group mutual exclusion problem, each critical section has a type or a group associated with it. Processes requesting critical sections belonging to the same group (that is, of the same type) may execute their critical sections concurrently. However, processes requesting critical sections belonging to different groups (that is, of different types) must execute their critical sections in a mutually exclusive manner. Most algorithms for solving the group mutual exclusion problem that have been proposed so far in the literature treat all groups equally. This is quite acceptable if a process, at the time of making a request for critical section, selects a group for the critical section uniformly. However, if some groups are more likely to be selected than others, then better performance can be achieved by treating different groups in a different manner. In this paper, we propose an efficient algorithm for solving the group mutual exclusion problem when group selection probabilities are non-uniformly distributed. Our algorithm has a message complexity of 2n-1 per request for critical section, where n is the number of processes in the system. It has low synchronization delay of one message hop and low waiting time of two message hops. The maximum concurrency of our algorithm is n, which implies that if all processes have requested critical sections of the same type then all of them may execute their critical sections concurrently. Finally, the amortized message-size complexity of our algorithm is O(1). Our experimental results indicate that our algorithm outperforms the existing algorithms, whose complexity measures are comparable to that of ours, by as much as 50% in some cases.
Reversibility of the Quad-Edge operations in the Voronoi data structure
Authors: Darka Mioc, Francois Anton, Christopher M. Gold, Bernard Moulin
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

In Geographic Information Systems the reversibility of map update operations have not been explored yet. In this paper we are using the Voronoi based Quad-edge data structure to define reversible map update operations. The reversibility of the map operations have been formalised at the lowest level, as the basic algorithms for addition, deletion and moving of spatial objects. Having developed reversible map operations on the lowest level, we were able to maintain reversibility of the map updates at higher level as well. The reversibility in GIS can be used for efficient implementation of rollback mechanisms and dynamic map visualisations.
Control Algorithm of a Multilevel Converter based on a Fuzzy Inference System using MATLAB
Authors: Salvador Revelo-Andrade, Mariano Fernandez-Nava, Pedro Banuelos-Sanchez, Felix E. Guerrero-Castro
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

Multilevel converters are power electronics system models not well defined; however, there are parameter variation problems. The model is multivariable, complex, and nonlinear. To combat such problems, various adaptive control techniques have been proposed. Fuzzy control doesn't strictly need any mathematical model plant. It is based on operator experience and heuristics, and it is easy to apply. This control is basically an adaptive and nonlinear control which gives robust performance for a nonlinear plant with complex behavior. Using MATLAB Fuzzy Logic Toolbox, practical experience, and heuristics, a control algorithm of a multilevel converter based on a fuzzy control is presented in this paper. A complete fuzzy inference process to control the converter is shown. Simulation results show that the implemented fuzzy control algorithm is a good adaptive control.
Bounds to the Rate Distortion Tradeoff of the Binary Markov Source
Authors: Dinkar Vasudevan
Venue: Proceedings of the 2007 Data Compression Conference (2007)

We provide bounds to the rate distortion tradeoff of the binary Markov source with the Hamming distance as the distortion measure. The tradeoff has been completely characterized by Gray [1] for distortions less than a critical value Dc. Our motivation is to examine the tradeoff for values of distortion above Dc. Our inner bound to the tradeoff follows from an achievable scheme that uses conditional codebooks based on decision feedback at the encoder. Our outer bound follows from an extension of the technique of Berger [3].
Greedy closure evolutionary algorithms
Authors: D. Ashlock, Ling Guo, Fang Qiu
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

We present a method of using a genetic algorithm to evolve controls for a greedy algorithm. We demonstrate the technique on the location of embeddable DNA markers for genetic libraries. The technique has the potential for broad application and other applications are discussed.
Framework for Establishing Enterprise Modeling in the Context of Collaborative Enterprises
Authors: Thomas KNOTHE, Timo KAHL, Dieter BOELL, Kristof SCHNEIDER
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Increased market dynamics, shorter product lifecycles and a higher customer involvement in product design have caused great changes to competitive conditions and many companies are confronted with the challenge of becoming interoperable. Becoming interoperable tackles a lot of areas within an enterprise (e.g. organizational structures, processes etc.) and the problem for most enterprises consist in identifying their weaknesses and strengths concerning their interoperability capabilities. Enterprise models have the goal to reduce complexity and give a representation of structures, activities, processes, information, resources, people and behavior of an enterprise and the dependencies between them. Especially for enterprise collaborations, models help to understand each other, to plan, implement and to support interactions. But most companies are not ready yet to harvest the benefits of enterprise modeling and fail in establishing model based collaborations. In the frame of enterprise integration and user oriented enterprise modeling this paper introduces an approach that supports enterprise stakeholders to implement enterprise modeling within collaborative companies. One objective is to present an approach that enables companies to get the most effect out of enterprise modeling in a collaborative environment based on the maturity of their organization relative to modeling.
A Robust Approach for Matching Mixed Casesensitive and Case-insensitive Patterns
Authors: Hongbin Lu, Kai Zheng, Bin Liu, Changhua Sun
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

As one of the key methods as well as a bottleneck for Network Intrusion Detection Systems (NIDSes) to detect and eliminate malicious traffic, pattern matching is increasingly gaining popularity while also faces threats from hackers' overloading attempts. The support of mixed case-sensitive and case-insensitive patterns, which is essential for NIDSes to detect possible attacks targeting different applications and operating systems, is currently a potential vulnerability since the widely used Convert-Search-Verify (CSV) approach encounters severe performance degradation in the worst-case scenarios. This paper firstly gives a thorough analysis on the reasons causing jams in the worst case, and then boosts up the performance by leveraging a novel mechanism named Convert-Search-incrementally-Verify (CSiV). CSiV differs from CSV in that it first merges possible case-sensitive matches to suspicious segments in the "Search phase, and then leverages an Aho-Corasick like algorithm to verify them. The infeasibility of the simple Double Search (DS) approach is also explained by analyzing its low average-case throughput. Extensive experiments based on real pattern sets along with both collected and artificial traffic traces show that, the performance of the proposed approach outperforms the DS approach by a factor of 2 in the ordinary cases, and is better than the CSV approach up to 5 times under the worst-case scenario, indicating both its feasibility and robustness for a worst-case safe NIDS.
Evaluating SFI for a CISC architecture
Authors: Stephen McCamant, Greg Morrisett
Venue: Proceedings of the 15th conference on USENIX Security Symposium - Volume 15 (2006)

Executing untrusted code while preserving security requires that the code be prevented from modifying memory or executing instructions except as explicitly allowed. Software-based fault isolation (SFI) or "sandboxing" enforces such a policy by rewriting the untrusted code at the instruction level. However, the original sandboxing technique of Wahbe et al. is applicable only to RISC architectures, and most other previous work is either insecure, or has been not described in enough detail to give confidence in its security properties. We present a new sandboxing technique that can be applied to a CISC architecture like the IA-32, and whose application can be checked at load-time to minimize the TCB. We describe an implementation which provides a robust security guarantee and has low runtime overheads (an average of 21% on the SPECint2000 benchmarks). We evaluate the utility of the technique by applying it to untrusted decompression modules in an archive tool, and its safety by constructing a machine-checked proof that any program approved by the verification algorithm will respect the desired safety property.
Intrinsic Hand Muscle Activation for Grasp and Horizontal Transport
Authors: Sara A. Winges, Bornali Kundu, John F. Soechting, Martha Flanders
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

During object manipulation, the hand and arm muscles produce internal forces on the object (grasping forces) and forces that result in external translation or rotation of the object in space (transport forces). The present study tested whether the intrinsic hand muscles are actively involved in transport as well as grasping. Intrinsic hand muscle activity increased with increasing demands for grasp stability, but also showed the timing and directional tuning patterns appropriate for actively transmitting external forces to the object, during the translational acceleration and deceleration of object transport.
ezHPC Security Architecture
Authors: George Moncrief, Trent Townsend, Scotty Swillie
Venue: Proceedings of the HPCMP Users Group Conference (2006)

High performance computing (HPC) within the Department of Defense (DoD) is vital to the execution of the research and development mission. However, users must access these resources using interfaces that are complicated, specialized, primitive, and opaque. ezHPC was developed to address this complexity. The ezHPC project is interesting in that it abstracts for the user many of the technical details and tools related to HPC within the DoD High Performance Computing Modernization Program (HPCMP) while providing a Web-based application that allows user access to HPC resources. Leveraging open-source, widely available technology, the ezHPC security model addresses the DoD security requirements for authentication, confidentiality, availability, and integrity. This paper discusses an architecture that employs end-to-end encryption, open-source technologies, message authentication codes, and authentication of users via the HPCMP-modified implementation of the Massachusetts Institute of Technology Kerberos. This architecture provides ezHPC the flexibility to reduce the technology barrier to those unfamiliar with interactive use of HPC systems while providing significant capability to more advanced users. The subsequent abstraction of HPC resources constitutes a security model for any Web-enabled application programming interface.
A maximum-likelihood parametric approach to source localizations
Authors: J. C. Chen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Source localization using passive sensor arrays has been an active research problem for many years. Most near-field source localization algorithms involve two separate estimations, namely, relative time-delay estimations and source location estimation. A one-step maximum-likelihood parametric source localization algorithm is proposed based on the maximum correlation between time shifted sensor data at the true source location. The performance of the algorithm is evaluated and shown to approach the Cramer-Rao bound asymptotically in simulations.