ppxscal/embedding_network huggingface dataset:
Polytechnic University's paradigm for graduate manufacturing engineering education
Authors: H. Khan
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

The paper describes Polytechnic University's Graduate Program in Manufacturing Engineering. We have developed a manufacturing engineering program focused on generally applicable methods that serves the needs of students, industry and the university effectively. The experimental approach we advocate and teach is portable, broadly applicable, inexpensive to implement and well-tuned to producing increased productivity and profitability in military and commercial firms alike. Our approach concentrates on methods that increase profitability and competitiveness by improving quality, cycle-time, design and production. The program is offered full-time and part-time. Full-time students can obtain the M.S. degree in one year. Because the methods we teach are generally applicable they are portable. They are equally applicable in defense and commercial manufacturing and contribute strongly to developing the "dual-use" capability sought by the APRA/TRP program. Within the University the program is cost-effective helps to prepare students to work in the industrial environment, and helps to develop fruitful relationships with industry. 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
On threshold behavior in query incentive networks
Authors: Esteban Arcaute, Adam Kirsch, Ravi Kumar, David Liben-Nowell, Sergei Vassilvitskii
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

Motivated by the role of incentives in large-scale information systems, Kleinberg and Raghavan (FOCS 2005) studied strategic games in decentralized information networks. Given a branching process that specifies the network, the rarity of answers to a specific question, and a desired probability of success, how much reward does the root node need to offer so that it receives an answer with this probability, when all of the nodes are playing strategically? For a specific family of branching processes and a constant failure probability, they showed that the reward function exhibited a threshold behavior that depends on the branching parameter b. In this paper we study two factors that can contribute to this transition behavior, namely, the branching process itself and the failure probability. On one hand we show that the threshold behavior is robust with respect to the branching process: for all branching processes and any constant failure probability, if b > 2 then the required reward is linear in the expected depth of the search tree, and if b < 2 then the required reward is exponential in that depth. On the other hand we show that the threshold behavior is fragile with respect to the failure probability σ: if σ is inversely polynomial in the rarity of the answer, then all branching processes require rewards exponential in the depth of the search tree.
Active source detection in a dispersive multiple-reflection environment
Authors: Z.-H. Michalopoulou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

A signal propagating in a shallow water waveguide is subjected to (a) multiple reflections off the ocean boundaries and (b) distortion because of the dispersive properties of the propagation medium. Because of these corruptions, the received signal differs substantially from the transmitted signal. Although the transmission is sometimes exactly known, the received signal cannot be described in detail because of inadequate knowledge of the ocean impulse response. Ignoring the effects of the ocean on the signal, or representing them inaccurately, can lead to deterioration of the detection statistics. This paper compares the performance of methods designed for distortion-free, multiple-reflection transmission in realistic, dispersive environments. Two existing methods, the RCI (replica correlation integration) processor and the simple source-receiver matched-filter, and a new detector are evaluated. The impact of distortion on signal transmission is assessed by comparing the distortion-free methods to the optimal processor, which models the effects of the propagation medium on the signal.
Active noise control using robust feedback techniques
Authors: M. O'Brien
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

With the resurgence of active noise control in the past two decades, the design and implementation of optimal noise cancellers has been a topic of considerable research. Recently, much of the investigation has focused on fixed controllers that rely on the robustness of closed loop systems to deal with poorly parameterized or changing plants. Many acoustic systems employ internal model controller structures designed via H/sub /spl infin// techniques to attain optimality. Absent from the literature, however, is a qualitative study of classical robust controllers applied to the active noise problem. This paper looks at the practical issues and possible pitfalls of applying H/sub /spl infin/_/optimal feedback controllers to one-dimensional acoustic ducts. In particular, it is observed that the relatively high degree of non-minimum-phase zeros, typical of acoustic plants, limits the ultimate performance of the optimal H/sub /spl infin// solution.
Numerical approach to differential equations of fractional order
Authors: Shaher Momani, Zaid Odibat
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, the variational iteration method and the Adomian decomposition method are implemented to give approximate solutions for linear and nonlinear systems of differential equations of fractional order. The two methods in applied mathematics can be used as alternative methods for obtaining analytic and approximate solutions for different types of differential equations. In these schemes, the solution takes the form of a convergent series with easily computable components. This paper presents a numerical comparison between the two methods for solving systems of fractional differential equations. Numerical results show that the two approaches are easy to implement and accurate when applied to differential equations of fractional order.
Towards an Autonomic Element Architecture for ASSL
Authors: Emil Vassev, Joey Paquet
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

This article is an introduction to our research towards a new generic architecture model for autonomic elements. In this article, we present briefly the Autonomic System Specification Language (ASSL) framework, which emphasizes the new architecture model. We go over the multi-tier architecture of the ASSL framework and explain in detail the autonomic element architecture's functional units. Moreover, we reveal the different architecture styles of autonomic systems imposed by ASSL. In this paper, we do not talk about implementation concerns or syntax and semantic aspects of ASSL, since these are going to be tackled by our ongoing research and described in other papers.
A tutorial approach to individualized instruction for an electronic computer aided design laboratory
Authors: J. A. Parker
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

This electronic computer-aided design (CAD) course (EET 320) moves the student from theoretical digital and analog circuits to the actual printed circuit board (PCB) design and layout as quickly as possible. Since the design of PCBs requires increasingly smaller board sizes and higher component densities, the utilization of extensive electronic CAD software packages is required to achieve circuit performance. These packages are windows- and menu-driven with many and varied options. Since each student works at his own computer and at his own pace with his own individual computer skills, a system of individualized instruction is required far a rapid introduction and fast-track development of these computer skills. Tutorials on (i) schematic capture, (ii) circuit simulation, (iii) PLD (programmable logic design) implementation, and (iv) PCB placement and routing on actual circuits advance skill levels rapidly. After going through these tutorials and circuit examples with step-by-step instructions, the student is ready to tackle more complicated circuits on an individual basis. Orcad CAD packages are used to implement all four main areas of this course. Using the PCB and integrated circuits, the actual circuit can then be constructed and tested. How well the actual circuit performs is the ultimate evaluation. 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
On the impossibility of a quantum sieve algorithm for graph isomorphism
Authors: Cristopher Moore, Alexander Russell, Piotr Sniady
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

It is known that any quantum algorithm for Graph Isomorphism thatworks within the framework of the hidden subgroup problem (HSP) must performhighly entangled measurements across Ω(n log n) coset states. One ofthe only known models for how such a measurement could be carried outefficiently is Kuperberg's algorithm for the HSP in the dihedral group, in whichquantum states are adaptively combined and measured according to thedecomposition of tensor products into irreducible representations. This "quantum sieve" starts with coset states, and works its way down towardsrepresentations whose probabilities differ depending on, for example, whetherthe hidden subgroup is trivial or nontrivial. In this paper we show that no such approach can produce a polynomial-time quantum algorithm for Graph Isomorphism. Specifically, we consider the natural reduction of Graph Isomorphism to the HSP over the the wreath product Sn ࣀ Z2. Using a recently proved bound on the irreducible characters of Sn, we show that no algorithm in this family can solve Graph Isomorphism in less than eΩ(√n) time, no matter what adaptive rule it uses to select and combine quantum states. In particular, algorithms of this type can offer essentially no improvement over the best known classical algorithms, which run in time eO(√(n log n)).
Sufficient optimality conditions for the control of discrete determinate systems with bounded composition of precise measurements
Authors: A. V. Panteleev
Venue: Automation and Remote Control (2007)

Sufficient optimality conditions for control of discrete determinate systems with incomplete state-vector feedback are formulated and demonstrated, and also relations for desired control determination are obtained. Application of the obtained relations is demonstrated by examples.
N semantic classes are harder than two
Authors: Ben Carterette, Rosie Jones, Wiley Greiner, Cory Barr
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We show that we can automatically classify semantically related phrases into 10 classes. Classification robustness is improved by training with multiple sources of evidence, including within-document cooccurrence, HTML markup, syntactic relationships in sentences, substitutability in query logs, and string similarity. Our work provides a benchmark for automatic n-way classification into WordNet's semantic classes, both on a TREC news corpus and on a corpus of substitutable search query phrases.
Construction and analysis of ground models and their refinements as a foundation for validating computer-based systems
Authors: Egon B&#x00f6;rger
Venue: Formal Aspects of Computing (2007)

We explain why for the verified software challenge proposed in Hoare (J ACM 50(1): 63&#x2013;69, 2003), Hoare and Misra (Verified software: theories, tools, experiments. Vision of a Grand Challenge project. In: [Meyer05]) to gain practical impact, one needs to include rigorous definitions and analysis, prior to code development and comprising both experimental validation and mathematical verification, of ground models, i.e., blueprints that describe the required application-content of programs. This implies the need to link via successive refinements the relevant properties of such high-level models in a traceable and checkable way to code a compiler can verify. We outline the Abstract State Machines (ASM) method, a discipline for reliable system development which allows one to bridge the gap between informal requirements and executable code by combining application-centric experimentally validatable system modelling with mathematically verifiable stepwise detailing of abstract models to compile-time-verifiable code.
The AADL behaviour annex -- experiments and roadmap
Authors: Ricardo Bedin Franca, Jean-Paul Bodeveix, Mamoun Filali, Jean-Francois Rolland, David Chemouil, Dave Thomas
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

In this paper, we present an evaluation of the AADL Behavioural Annex that is currently in evaluation phase. We relate our experiment with respect to a development concerning the reengineering of a flight software. This experiments has led us to introduce hierarchical aspects and study the link especially with AADL modes. We discuss about the definition of a semantics for the AADL execution model and propose some enhancements.
Organization-based analysis of web-object sharing and caching
Authors: Alec Wolman, Geoff Voelker, Nitin Sharma, Neal Cardwell, Molly Brown, Tashana Landray, Denise Pinnel, Anna Karlin, Henry Levy
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

Performance-enhancing mechanisms in the World Wide Web primarily exploit repeated requests to Web documents by multiple clients. However, little is known about patterns of shared document access, particularly from diverse client populations. The principal goal of this paper is to examine the sharing of Web documents from an organizational point of view. An organizational analysis of sharing is important, because caching is often performed on an organizational basis; i.e., proxies are typically placed in front of large and small companies, universities, departments, and so on. Unfortunately, simultaneous multi-organizational traces do not currently exist and are difficult to obtain in practice. The goal of this paper is to explore the extent of document sharing (1) among clients within single organizations, and (2) among clients across different organizations. To perform the study, we use a large university as a model of a diverse collection of organizations. Within our university, we have traced all external Web requests and responses, anonymizing the data but preserving organizational membership information. This permits us to analyze both inter-and intra-organization document sharing and to test whether organization membership is significant. As well, we characterize a number of parameters of our data, including basic object characteristics, object cacheability, and server distributions.
Sensory Property in Fusion of Visual/Haptic Cues by Using Mixed Reality
Authors: Morio Nakahara, Itaru Kitahara, Yuichi Ohta
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

When we recognize objects, multiple sensory information (e.g., visual, auditory, and haptic) is used with fusion. For example, both eyes and hands provide relevant information about an object's shape. We investigate how sensory stimuli interact with each other. For that purpose, we developed a system that gives haptic/ visual sensory fusion using a mixed reality technique. Our experiments show that the haptic stimulus seems to be affected by visual stimulus when a discrepancy exists between vision and haptic stimuli.
Modern Distributed Data Acquisition and Control Systems Based on OPC Techniques
Authors: Vu Van Tan, Dae-Seung Yoo, Myeong-Jae Yi
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Web technologies are gaining increased importance in automation control systems, especially in slow control systems. Alternatively, the requirements to exchange the complex data between the cooperating applications and the applications-based non-Microsoft Platforms are widely increasing in the industrial systems. The applications-based OPC (OLE for Process Control) technique to exchange data between the measurement and control systems on plant floor with XML leverages are proposed in the OPC XML DA (Data Access) Specification. Moreover, we are expecting a system that allows easily aggregating the existing productions and maintenance managements with new products as frameworks. This system also allows exchanging the data between collaborating applications in horizon. Besides, the high performance and the ability to read and decode any type of the data from measurement and control systems are important factors in the application design. This paper introduces new control system aspects that are used for the design of slow control systems. In general, they are based on the OPC and XML technologies. Main aspects are the throughout of standards for interfaces, functionalities and architectures. To guarantee the security problems in system, this paper also discusses the levels of the security in automation and control systems. These discussions provide more security solutions for technical-level readers.
New Topology Management Algorithms for Unstructured P2P Networks
Authors: Annemari Auvinen, Mikko Vapa, Matthieu Weber, Niko Kotilainen, Jarkko Vuori
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

In this paper we present new topology management algorithms used to self-organize the overlay of a peer-to-peer network. The algorithms are Node Selection, Node Removal, Overload Estimation and Overtaking algorithms. The algorithms have been evaluated using a simple P2P scenario using the P2PRealm network simulator. Based on the simulation results, the algorithms produce an overlay which is stable and has a short average distance between nodes.
Flooding attacks by exploiting persistent forwarding loops
Authors: Jianhong Xia, Lixin Gao, Teng Fei
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

In this paper, we present flooding attacks that exploit routing anomalies in the Internet. In particular, we focus on routing anomalies introduced by persistent forwarding loops. Persistent forwarding loops may share one or more links with forwarding paths to reachable addresses. An attacker can exploit persistent forwarding loops to overload the shared links to disrupt the Internet connectivity to those reachable addresses. To understand the extent of this vulnerability, we perform extensive measurements to systematically study persistent forwarding loops and the number of network addresses that can be affected. We find that persistent forwarding loops do exist in the current Internet. About 0.2% of routable addresses experience persistent forwarding loops and 0.21% of routable addresses can be attacked by exploiting persistent forwarding loops. In addition, 85.16% of the persistent forwarding loops appear within destination domains and they can be observed from various locations, which makes it possible to launch attacks from many vantage points. We also find that most persistent forwarding loops are just two hops long, which enables an attacker to amplify traffic to persistent forwarding loops significantly. To the best of our knowledge, this is the first study of exploiting the vulnerability of persistent forwarding loops to launch DDoS attacks.
A system for unrestricted topic retrieval from radio news broadcasts
Authors: D. A. James
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The "topic classification" systems described in the speech literature typically partition a collection of spoken messages into a small number of pre-defined topics. As such, they are only useful if the set of message topics does not vary over time. However, the techniques of textual information retrieval (IR) have long allowed for retrieval by arbitrary subject from a document collection. This paper describes experiments in unrestricted retrieval from a collection of radio news broadcasts. A hybrid message indexing strategy, with conventional word recognition and a fast lattice-based wordspotter, allows for the retrieval of news reports concerning any subject. The results show that retrieval can be carried out extremely quickly and that high accuracy is possible, even with recognition output errors.
A postfilter for echo and noise reduction avoiding the problem of musical tones
Authors: S. Gustafsson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

We address the problem of acoustic echo cancellation and noise reduction for narrow and wide band telephone applications. We combine a conventional echo canceller with a postfilter implemented in the frequency domain and derive an algorithm for the simultaneous attenuation of residual echo and noise. The main goals are a low level natural sounding background noise without artifacts such as musical tones, and an inaudible residual echo. This is achieved by considering the masking properties of the human auditory system. Simulation results verify that these goals are reached, while the distortion of the near end speech is comparable to conventional algorithms.
Monadic robotics
Authors: John Peterson, Greg Hager
Venue: Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2 (1999)

We have developed a domain specific language for the construction of robot controllers, Frob (functional ROBotics). The semantic basis for Frob is Functional Reactive Programming, or simply FRP, a purely functional model of continuous time, interactive systems. FRP is built around two basic abstractions: behaviors, values defined continuously in time, and events, discrete occurances in time. On this foundation, we have constructed abstractions specific to the domain of robotics. Frob adds yet another abstraction: the task, a basic unit of work defined by a continuous behavior and a terminating event. This paper examines two interrelated aspects of Frob. First, we study the design of systems based on FRP and how abstractions defined using FRP can capture essential domain-specific concepts for systems involving interaction over time. Second, we demonstrate an application of monads, used here to implement Frob tasks. By placing our task abstraction in a monadic framework, we are able to organize task semantics in a modular way, allowing new capabilities to be added without pervasive changes to the system. We present several robot control algorithms specified using Frob. These programs are clear, succinct, and modular, demonstrating the power of our approach.