ppxscal/embedding_network huggingface dataset:
Fast Single-Shot Multiclass Proximal Support Vector Machines and Perceptions
Authors: K. P. Soman, R. Loganathan, M. S. Vijaya, V. Ajay, K. Shivsubramani
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Recently Sandor Szedmak and John Shawe-Taylor [1] showed that Multiclass Support Vector Machines [3, 4] can be implemented with single class complexity. In this paper we show that computational complexity of their algorithm can be further reduced by modelling the problem as a Multiclass Proximal Support Vector Machines. The new formulation requires only a linear equation solver. The paper then discusses the multiclass transformation of Iterative Single data Algorithm [8]. This method is faster than the first method. The two algorithm are so much simple that SVM training and testing of huge datasets can be implemented even in a spreadsheet.
Advances in signatures, encryption, and e-cash from bilinear groups
Authors: Ronald L. Rivest
Venue:  (2006)

We present new formal definitions, algorithms, and motivating applications for three natural cryptographic constructions. Our constructions are based on a special type of algebraic group called bilinear groups . (1) Re-signatures. We present the first public key signature scheme where a semi-trusted proxy, given special information, can translate Alice's signature on a message into Bob's signature on the same message. The special information, however, allows nothing else, i.e., the proxy cannot translate from Bob to Alice, nor can it sign on behalf of either Alice or Bob. We show that a path through a graph can be cheaply authenticated using this scheme, with applications to electronic passports. (2) Re-encryption. We present the first public key cryptosystem where a semi-trusted proxy, given special information, can translate an encryption of a message under Alice's key into an encryption of the same message under Bob's key. Again, the special information allows nothing else, i.e. the proxy cannot translate from Bob to Alice, decrypt on behalf of either Alice or Bob, or learn anything else about the message. We apply this scheme to create a new mechanism for secure distributed storage. (3) Compact e-cash with tracing and bounded-anonymity . We present an offline e-cash system where 2&ell; coins can be stored in O(&ell; + k) bits and withdrawn or spent in O(&ell; + k) time, where k is the security parameter. The best previously known schemes required at least one of these complexities to be O(2 &ell; &middot; k). In our system, a user's transactions are anonymous and unlinkable, unless she performs a forbidden action, such as double-spending a coin. Performing a forbidden action reveals the identity of the user, and optionally allows to trace all of her past transactions. We provide solutions without using a trusted party. We argue why features of our system are likely to be crucial to the adoption of any e-cash system. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Stability of the 2D Fornasini-Marchesini model with periodic coefficients
Authors: T. Bose
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The stability of two-dimensional (2D) periodically shift varying (PSV) filters is considered. These filters have applications in filtering video signals with cyclostationary noise, image and video scrambling, and design of multiplierless filters. The considered system is represented in state space by the first model of Fornasini-Marchesini with periodic coefficients. The stability of this model is then studied. Two necessary conditions and two sufficient conditions are established for asymptotic stability. The conditions are easy to use and computationally simple.
Flexible and safe resolution of file conflicts
Authors: Puneet Kumar, M. Satyanarayanan
Venue: Proceedings of the USENIX 1995 Technical Conference Proceedings on USENIX 1995 Technical Conference Proceedings (1995)

In this paper we describe the support provided by the Coda File System for transparent resolution of conflicts arising from concurrent updates to a file in different network partitions. Such partitions often occur in mobile computing environments. Coda provides a framework for invoking customized pieces of code called application-specific resolvers (asrs) that encapsulate the knowledge needed for file resolution. If resolution succeeds, the user notices nothing more than a slight performance delay. Only if resolution fails does the user have to resort to manual repair. Our design combines a rule-based approach to ASR selection with transactional encapsulation of ASR execution. This paper shows how such an approach leads to flexible and efficient file resolution without loss of security or robustness.
Issues in the Design of Flexible and Dynamic Service-Oriented Systems
Authors: Gerald C. Gannod, Janet E. Burge, Susan D. Urban
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Due to the use of the concepts embedded in Service- Oriented Architecture (SOA), software design, now more than ever, involves the use of incomplete information. Applications that utilizeWeb Services are also highly impacted by the problem of deployment and subsequent undeployment of services. Specifically, there is a level of uncertainty caused by the potential for services to become unavailable (either temporarily or permanently). In a scenario where an application must switch from one service to another due to the undeployment problem, the client application may require that new or different handlers be used to cope with the properties of the alternative service. In this current development climate, the design issues become clear: there is a need to reason about how a design is impacted by discovered services, design analysis must consider the transaction and event properties of discovered services, and design of systems must incorporate fault tolerance and high-integrity issues to cope with the dynamic landscape caused by the uncertainty associated with using services.
Outcomes based engineering education. I. Theory and practice in the derivation of "outcomes". A European historical perspective
Authors: J. Heywood
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

A brief account of the origins of the "outcomes" movement in education is given. It is concluded that there is no real difference between the objectives movement of yesterday and the "outcomes" movement of today. Differences between the approaches of Mager and the authors of The Taxonomy of Eductional Objectives are outlined. Some limitations of The Taxonomy from an engineering perspective are illustrated. An alternative approach to the derivation of "outcomes", which is based on task analyses of the work engineers do, is described. One of the problems with the The Taxonomy is its semantic structure which many teachers find difficult to internalize. A method enabling teachers to develop their own semantic structure and at the same time acquire ownership is given in this paper it is further argued noted that just as teachers need to "own" their "outcomes" so to do students. There are many sources of "outcomes". Apart from surveys of alumni and task analyses there are valuable sources to be found in learning theory (e.g. how concepts and principles are learnt, cognitive development and higher order thinking). The principle lessons of the past are that curriculum designers tend to generate too many "outcomes" which constrain both teachers and students. These cause surface approaches to learning. In order to obtain study in depth it is essential to allow time for assimilation. 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
Integrating instructional technology methodologies in a state of the art industrial control laboratory
Authors: W. A. Moreno
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Recent observations confirm the escalating concern of the general engineering educational community about enhancing the teaching of traditional control theory courses. The objective of this project is to improve the learning experience in a new industrial control laboratory using the latest techniques in instructional technology by incorporating newly developed software tools in order to better deliver, not only the mathematical foundation, but also to enhance the important relationship of the interdisciplinary nature of a typical introductory control course in engineering. At the University of South Florida, Department of Electrical Engineering, an effort is under way to develop a set of control laboratory experiments in a Web-managed environment to introduce the students to techniques needed for the design and implementation of automatic industrial control systems. The conclusions and future work section estimate the impact of the innovations on the student, teacher and department.
Low-power digital filtering via soft DSP
Authors: R. Hegde
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

We propose a low-power filtering algorithm developed via the soft DSP framework. Soft DSP refers to scaling the supply voltage of a DSP implementation beyond the voltage required to match its critical path delay to the throughput. This deliberate introduction of input-dependent errors leads to degradation in the algorithmic performance, which is then compensated for via algorithmic error-control schemes. The proposed error-control schemes, based on forward/backward linear prediction, provides improved performance over the ones proposed in the past by exploiting correlation in both leading and trailing samples with a latency penalty. It is shown that (a) the proposed scheme provides 60-80% reduction in energy dissipation over that achieved via conventional voltage scaling and (b) for the same algorithmic performance, the overhead involved in the proposed algorithm is more than 50% smaller than existing schemes for medium bandwidth filters.
Wavelet-Networks for Prediction of Ozone Levels in Puebla City Mexico
Authors: E. S. Garcia-Trevino, V. Alarcon-Aquino, M. A. Herrera-Garcia
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

Wavelet-networks are inspired by both the feed forward neural networks and the theory underlying wavelet decompositions. This special kind of networks has proved its advantages over other networks schemes, particularly in approximation and prediction problems. In this paper a novel approach, based on a wavelet neural network structure with correlation-based initialisation and training algorithm, is introduced in order to face with the problem of pollutant estimation in a metropolitan area. In particular a short-term prediction of the maximum ozone pollutant value has been performed. Ozone gas is considered one ofthe most common and damaging air contaminants. The results reported in this work show clearly that wavelet networks have good prediction properties and seriously represent a novel alternative to the traditional ozone forecasting methods.
Plucked-string synthesis algorithms with tension modulation nonlinearity
Authors: V. Valimaki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Digital waveguide modeling of a nonlinear vibrating string is investigated when the nonlinearity is essentially caused by tension modulation. We derive synthesis models where the nonlinearity is implemented with a time-varying fractional delay filter. Also, conversion from a dual-delay-line physical model into a single-delay-loop model is explained. Realistic synthetic tones with nonlinear effects are obtained by introducing minor amendments to a linear string synthesis algorithm. It is shown how synthetic plucked-string tones are modified as a consequence of tension modulation.
Piezoelectric Ultrasonic Actuator for a Haptic Display for Catheterisation
Authors: Stephanie Klages, Thorsten A. Kern, Thorsten Meiss, Roland Werthschutzky
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

During a catheterisation, the surgeon's navigation to the coronary vessels is restricted to a twodimensional X-ray image. The HapCath system presents a haptic feedback to the surgeon to enable a more intuitive navigation similar to a blindman's cane. In this paper the actuation system for the haptic interface is shown. A piezoelectric ultrasonic actuator is used to generate force and torque on the guide wire. The main working principle of the actuator is described. The advantages compared to dynamic actuating systems are described.
Quantifying Behind Armor Debris Fragments from CTH Using the Interdisciplinary Computing Environment
Authors: Jerry A. Clarke, Eric R. Mark
Venue: Proceedings of the HPCMP Users Group Conference (2006)

The multi-material, large deformation, strong shock wave, solid mechanics code CTH is heavily used for armor penetration applications. It would be extremely beneficial to be able to use this type of physics based simulation to produce a realistic behind armor debris (BAD) field as input to survivability and lethality codes. Utilizing the capabilities of the Interdisciplinary Computing Environment (ICE) we have developed a tool that is capable of identifying individual fragments in a CTH flat mesh or AMR calculation. Additionally, this tool produces an estimate of the volume (thus mass) and velocity of these arbitrarily shaped fragments, outputting the results into a text file that is suitable for use as input to survivability/lethality calculations.
Restricted 123-avoiding Baxter permutations and the Padovan numbers
Authors: Toufik Mansour, Vincent Vajnovszki
Venue: Discrete Applied Mathematics (2007)

Baxter studied a particular class of permutations by considering fixed points of the composite of commuting functions. This class is called Baxter permutations. In this paper we investigate the number of 123-avoiding Baxter permutations of length n that also avoid (or contain a prescribed number of occurrences of) another certain pattern of length k. In several interesting cases the generating function depends only on k and is expressed via the generating function for the Padovan numbers.
Attribute grammars for scalable query processing on XML streams
Authors: Christoph Koch, Stefanie Scherzinger
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2007)

We introduce the notion of XML Stream Attribute Grammars (XSAGs). XSAGs are the first scalable query language for XML streams (running strictly in linear time with bounded memory consumption independent of the size of the stream) that allows for actual data transformations rather than just document filtering. XSAGs are also relatively easy to use for humans. Moreover, the XSAG formalism provides a strong intuition for which queries can or cannot be processed scalably on streams. We introduce XSAGs together with the necessary language-theoretic machinery, study their theoretical properties such as expressiveness and complexity, and discuss their implementation.
Comparative Study on SRAMs for Suppressing Both Oxide-Tunneling Leakage and Subthreshold Leakage in Sub-70-nm Leakage Dominant VLSIs
Authors: Duk-Hyung Lee, Dong-Kone Kwak, Kyeong-Sik Min
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

In this paper, we compare 4 SRAM circuits. They are the conventional "SRAM1', "SRAM2' with power switches on VSS line, "SRAM3' with switches on VDD line, and "SRAM4' with switches on VDD and VSS lines, respectively. Among 4 SRAMs, SRAM2 shows the smallest amount of leakage, because its subthreshold leakage is most suppressed by its BODY and DIBL effects. To reduce the oxide-tunneling leakage more, "SRAM5' with lowering of its precharge voltage is considered in this paper. Compared with SRAM2 without lowering of the precharge voltage, the amounts of leakage of SRAM5 are suppressed by 27.2%, 16.8%, and 6.3%, respectively, at -25°C, 25°C, and 100°C.
Motion adaptive error resilient encoding for MPEG-4
Authors: S. T. Worrall
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Optimising delivery of video codecs such as MPEG-4 is vital to ensure that acceptable quality can be offered to 3G network customers. The error prone nature of mobile channels means that the video codec that is employed must be fairly robust. In the past, such research has required alteration to existing standards. Given the imminent implementation of 3G technologies, changing the standards is not a convenient option. This paper presents a technique for altering MPEG-4 encoding parameters to increase the error robustness of the output bitstream. It exploits the fact that frames with a high degree motion are often more sensitive to error than those with low amounts of motion. Using a simple model, the video packet length and number of adaptive intra refresh (AIR) blocks are varied according to the amount of motion in a frame. Simulations using a GPRS channel are presented to confirm the benefits of the proposed scheme.
Procedural steps for designing and implementing an evaluative research using outcome based program evaluation
Authors: H. Khan
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Skills in the cognitive domains of manufacturing engineering technologists are identified according to Bloom's Taxonomy (Cronbach, 1983). Skills visible as behavioral outcomes of affect and psychomotor are stated in terms of progress toward the outcome as evidence of changed behavior. Previous researchers in manufacturing engineering have conducted broad based research in desirable skills outlining the specific competencies that are presently needed or will be needed by the year 2000. The professional society of manufacturing engineering called the Society of Manufacturing Engineers has produced a voluminous publication called Profile 2000 and Profile 2002 outlining such research. But these are only inputs to the curriculum. Effectiveness of a curriculum is judged by the outputs-reasonable performance of the program in terms of "behaviors as evidence". Information gathered from published resources like Journal of Engineering Technology and Society of Manufacturing Engineers (SME) Profile 2000/2002 are used as "input information" from which the outcome statements are generated. They are categorized to a few outlined areas of importance as deemed proper by the Society of Manufacturing Engineers. The desirable outcomes as evidence are clear and concise expressions of behaviors that the successful student (as a stakeholder) must demonstrate at the close of his/her program. These are not the competencies required in each area of curricular endeavor because acquiring "competencies" acceptable as evidence does not guarantee that those competencies are used effectively. The administrators and the faculty also must evaluate the program as key stakeholders with the student perception of success. Outcome based program evaluation has the strength of being "interpretive" or "qualitative" as it occurs in social context, and is readily amenable to qualitative study. However the procedural steps outlined in the study are used for quantitative program evaluation by a study of different stakeholder perceptions. 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
Scalability and failure recovery in a linux cluster file system
Authors: Kenneth W. Preslan, Andrew Barry, Jonathan Brassow, Michael Declerck, A. J. Lewis, Adam Manthei, Ben Marzinski, Erling Nygaard, Seth Van Oort, David Teigland, Mike Tilstra, Steven Whitehouse, Matthew O'Keefe
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

In this paper we describe how we implemented journaling and recovery in the Global File System (GFS), a shared-disk, cluster file system for Linux. We also present our latest performance results for a 16-way Linux cluster.
The Second Order Local-Image-Structure Solid
Authors: Lewis D. Griffin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Characterization of second order local image structure by a 6D vector (or jet) of Gaussian derivative measurements is considered. We consider the affect on jets of a group of transformations—affine intensity-scaling, image rotation and reflection, and their compositions—that preserve intrinsic image structure. We show how this group stratifies the jet space into a system of orbits. Considering individual orbits as points, a 3D orbifold is defined. We propose a norm on jet space which we use to induce a metric on the orbifold. The metric tensor shows that the orbifold is intrinsically curved. To allow visualization of the orbifold and numerical computation with it, we present a mildly-distorting but volume-preserving embedding of it into euclidean 3-space. We call the resulting shape, which is like a flattened lemon, the second order local-image-structure solid. As an example use of the solid, we compute the distribution of local structures in noise and natural images. For noise images, analytical results are possible and they agree with the empirical results. For natural images, an excess of locally 1D structure is found.
Multi-frame Approaches To Improve Face Recognition
Authors: Deborah Thomas, Kevin W. Bowyer, Patrick J. Flynn
Venue: Proceedings of the IEEE Workshop on Motion and Video Computing (2007)

Face recognition from video sequences is becoming an important area of biometrics research. In this work, we explore different strategies to improve face recognition performance from video. We develop a good strategy to select the smallest number of frames to achieve a high level of performance. We apply Principal Component Analysis to identify suitable frames to represent the subjects. We demonstrate our approaches on our dataset, which uses three different cameras and is larger than any known research database of video face sequences. Finally, we compare our approach to an existing approach from UCSD [8, 9] and show that it performs slightly better than that approach (99% rank one recognition rate).
Scientific Computing Using pPVM
Authors: K. Maly, S. Kelkar, M. Zubair
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Execution time of an application running on a cluster of workstations is critically dependent upon the performance of the underlying communication network, especially when the application demands for large data transfers among workstations. In this research, we use parallel network approach to improve the communication network performance and demonstrate this in a real cluster computing environment using multiple Ethernets. We modified the PVM environment to pPVM to schedule the application data onto multiple networks, the scheduling strategy being either round-robin or adaptive. The adaptive strategy performs well for both equal and unequal distribution of background load on the channels, and also for time-varying background load.