ppxscal/embedding_network huggingface dataset:
An experts approach to strategy selection in multiagent meeting scheduling
Authors: Elisabeth Crawford, Manuela Veloso
Venue: Autonomous Agents and Multi-Agent Systems (2007)

In the multiagent meeting scheduling problem, agents negotiate with each other on behalf of their users to schedule meetings. While a number of negotiation approaches have been proposed for scheduling meetings, it is not well understood how agents can negotiate strategically in order to maximize their users' utility. To negotiate strategically, agents need to learn to pick good strategies for negotiating with other agents. In this paper, we show how agents can learn online to negotiate strategically in order to better satisfy their users' preferences. We outline the applicability of experts algorithms to the problem of learning to select negotiation strategies. In particular, we show how two different experts approaches, plays [3] and Exploration---Exploitation Experts (EEE) [10] can be adapted to the task. We show experimentally the effectiveness of our approach for learning to negotiate strategically.
Maximum-likelihood blind equalization of multiple FIR channels
Authors: E. De Carvalho
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We pursue our iterative quadratic maximum likelihood (IQML) approach to blind estimation of multiple FIR channels. We use a parameterization of the noise subspace in terms of linear prediction quantities. This parameterization is robust w.r.t. a channel length mismatch. Specifically, when the channel length is overestimated, no problems occur. Underestimation leads to a reduced-order channel estimate. We introduce two matched filter bounds (MFBs) to characterize the performance of receivers using reduced-order channel models. The first one (MFB1) uses the channel model to perform the spatio-temporal matched filtering that yields data reduction from multichannel to single-channel form. The rest of the processing remains optimal. MFB2 on the other hand bounds the performance of the Viterbi algorithm with the reduced channel model. It is shown that the reduced model provided by IQML is the one that maximizes MFB1. We also propose some low complexity techniques for obtaining consistent estimates with which to initialize IQML.
What Are the Chances an Availability SLA will be Violated?
Authors: Andrew P. Snow, Gary R. Weckman
Venue: Proceedings of the Sixth International Conference on Networking (2007)

There is danger in coming to important conclusions based on averages, as insights into spread are not provided by this single measure. When promises are made about availability this is a "mean". Knowledge of availability probabilistic distribution is paramount in understanding what is being offered and what is being bought, as the chance an availability SLA will be violated can be ascertained. Here, the distribution of a typical availability promise, "Five-Nines" or 0.99999, is determined for different DS-3 reliability and maintainability scenarios. As two random variables are in play, "time to fail" and "time to restore", the determination of availability distribution is analytically intractable. Monte Carlo simulation, with exponential failure and repair distributions, is performed to gain insights into availability distribution. The principal findings are that significant chances Five-Nines availability will be violated exist, and that the reliability/maintainability strategy used by the carrier determines availability SLA violation risk.
Pseudo-QMF filter banks for audio signals subband coding
Authors: F. Cruz-Roldan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Pseudo-QMF banks in which there is no optimization involved in order to obtain the prototype filter used in the cosine modulation are an advance that simplifies the system design. In this paper, three filter bank design methods that satisfy this requirement-all of them employ any conventional designing technique-are proposed. These filter banks do not introduce phase distortion, their aliasing is comparable to the stopband gain of the prototype filter and amplitude distortion can be really minimized. The differences among them are prototype filter specifications and the initial phase factor election. When the prototype filters are appropriately designed, the total error on the reconstructed output signal is reduced. An example where an audio signal is the input signal is included.
Low-Cost Microarchitectural Support for Improved Floating-Point Accuracy
Authors: William R. Dieter, Akil Kaveti, Henry G. Dietz
Venue: IEEE Computer Architecture Letters (2007)

Some processors designed for consumer applications, such as Graphics Processing Units (GPUs) and the CELL processor, promise outstanding floating-point performance for scientific applications at commodity prices. However, IEEE single precision is the most precise floating-point data type these processors directly support in hardware. Pairs of native floatingpoint numbers can be used to represent a base result and a residual term to increase accuracy, but the resulting order of magnitude slowdown dramatically reduces the price/performance advantage of these systems. By adding a few simple microarchitectural features, acceptable accuracy can be obtained with relatively little performance penalty. To reduce the cost of native-pair arithmetic, a residual register is used to hold information that would normally have been discarded after each floating-point computation. The residual register dramatically simplifies the code, providing both lower latency and better instruction-level parallelism.
Designing concurrent engineering and computer integrated manufacturing into a manufacturing engineering technology program
Authors: K. L. Kitto
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

To better prepare graduates for a rapidly changing global market place, concurrent engineering (CE) and computer integrated manufacturing (CIM) concepts have been fully integrated into the manufacturing engineering technology (MET) program at Western Washington University. Freshman students are taught solid modeling, design concepts and basic CIM in their introductory graphics courses. Sophomore students are taught the basics of CIM with an introduction to computer numerical control (CNC) machining, data file translation and the production of real tooling and parts. Junior students have an entire slate of design oriented basic engineering mechanics, fluid power and CNC machining courses. A real shop floor atmosphere has been constructed for the CIM, CNC and robotics classes with a new Haas CNC vertical mill with an automatic tool changer, a new Mazak turning center, a new Brown and Sharp coordinate measuring machine (CMM) and a used ASEA/ABB articulated arm robot. Senior students complete their studies with courses in robotics and automation, CIM, quality assurance, advanced CNC and a capstone senior project with industrial sponsors. Manufacturing students interact with electronics and plastics engineering technology students, industrial design students and industrial technology students. The paper describes the development of the CIM/CNC/Robotics laboratory, the integration of CIM and CE throughout the entire MET curriculum, the faculty development accompanying such changes, the faculty team effort to make these changes, course changes and examples of projects exemplifying CE and CIM in the past year. 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
Throughput improvement on RED mechanism
Authors: S. Prabhavat, R. Varakulsiripunth, S. Noppanakeepong
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The Internet Engineering Task Force (IETF) had recommended the active queue management (AQM) scheme to solve the global synchronization problems in TCP/IP based networks for next generation routers. Since then, random early detection (RED) has been proposed as one of the AQM schemes. However, the major problems of the RED mechanism are low throughput achievement and high number of consecutive drop. We have proposed the extended drop slope random early detection (ExRED) mechanism in order to overcome these problems. The ExRED can reduce both the average number of dropped packets and the consecutive drop probability, hence network throughput is improved while all other advantages of RED are retained.
A best-first probabilistic shift-reduce parser
Authors: Kenji Sagae, Alon Lavie
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Recently proposed deterministic classifier-based parsers (Nivre and Scholz, 2004; Sagae and Lavie, 2005; Yamada and Mat-sumoto, 2003) offer attractive alternatives to generative statistical parsers. Deterministic parsers are fast, efficient, and simple to implement, but generally less accurate than optimal (or nearly optimal) statistical parsers. We present a statistical shift-reduce parser that bridges the gap between deterministic and probabilistic parsers. The parsing model is essentially the same as one previously used for deterministic parsing, but the parser performs a best-first search instead of a greedy search. Using the standard sections of the WSJ corpus of the Penn Treebank for training and testing, our parser has 88.1% precision and 87.8% recall (using automatically assigned part-of-speech tags). Perhaps more interestingly, the parsing model is significantly different from the generative models used by other well-known accurate parsers, allowing for a simple combination that produces precision and recall of 90.9% and 90.7%, respectively.
Control and data flow aspects in the design of a wireless data radio modem: a case study
Authors: G. Post
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We present the design of a radio modem for the MOBITEX wireless data system. The MOBITEX interface specification defines the protocols that are used for communication between the MOBITEX network and mobile terminal devices. The specification refers to the ISO/OSI standards and defines the link layer and the physical layer of the air-link radio protocol for mobile terminals, as well as the network layer protocol that describes how packets are transmitted between the sender and the addressee. Because the design of a MOBITEX radio modem should serve as an application case study for identifying the needs in a joint air-link and network protocol design, we use different existing design methods and software tools for the specification of the lower three layers. For analyses and design we use Rumbaugh's object modeling technique (OMT). For implementation and validation we apply the standardized specification and description language SDL and data-flow oriented system specifications.
Small depth quantum circuits
Authors: Debajyoti Bera, Frederic Green, Steven Homer
Venue: ACM SIGACT News (2007)

Small depth quantum circuits have proved to be unexpectedly powerful in comparison to their classical counterparts. We survey some of the recent work on this and present some open problems.
CIM: A Reliable Metric for Evaluating Program Phase Classifications
Authors: Sreekumar Kodakara, Jinpyo Kim, David Lilja, Douglas Hawkins, Wei-Chung Hsu, Pen-Chung Yew
Venue: IEEE Computer Architecture Letters (2007)

We propose the use of the Confidence Interval of estimated Mean (CIM), a metric based on statistical sampling theory, to evaluate the quality of a given phase classification and for comparing different phase classification schemes. Previous research on phase classification used the Weighted Average of Coefficient of Variation (CoVwa) to estimate phase classification quality. We found that the phase quality indicated by CoVwa could be inconsistent across different phase classifications. We explain the reasons behind this inconsistency and demonstrate the inconsistency using data from several SPEC CPU2000 benchmark programs. We show that the Confidence Interval of estimated Mean (CIM) correctly estimates the quality of phase classification with a meaningful statistical interpretation.
Variable partitioning for dual memory bank DSPs
Authors: R. Leupers
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

DSPs with dual memory banks offer high memory bandwidth, which is required for high-performance applications. However, such DSP architectures pose problems for C compilers, which are mostly not capable of partitioning program variables between memory banks. As a consequence, time-consuming assembly programming is required for an efficient coding of time-critical algorithms. This paper presents a new technique for automatic variable partitioning between memory banks in compilers, which leads to a higher utilization of available memory bandwidth in the generated machine code. We present experimental results obtained by integrating the proposed technique into an existing C compiler for the AMS Gepard, an industrial DSP core.
Towards a web of patterns
Authors: Jens Dietrich, Chris Elgar
Venue: Web Semantics: Science, Services and Agents on the World Wide Web (2007)

Design patterns have been used successfully in recent years in the software engineering community in order to share knowledge about the structural and behavioural properties of software. There is a growing body of research in the area of design pattern detection and design recovery, requiring a formal description of patterns which can be matched by tools against the software that is to be analysed. We propose a novel approach to the formal definition of design patterns that is based on the idea that design patterns are knowledge that is shared across a community and that is by nature distributed and inconsistent. By using the web ontology language (OWL) we are able to formally define design patterns and some related concepts such as pattern participant, pattern refinement, and pattern instance. We discuss the respective ontology and give examples of how patterns can be defined using this ontology. We present the prototype of a Java client that accesses the pattern definitions and detects patterns in Java software, and analyse some scan results. This leads to the discussion on design pattern instantiation.
Column Pruning Beats Stratification in Effort Estimation
Authors: Omid Jalali, Tim Menzies, Dan Baker, Jairus Hihn
Venue: Proceedings of the Third International Workshop on Predictor Models in Software Engineering (2007)

Local calibration combined with stratification, also known as row pruning, is a common technique used by cost estimation professionals to improve model performance. The results presented in this paper raise several serious questions concerning the benefits of row pruning for improving effort estimation indicating the need to rethink standard practice. Firstly, the mean size of improvements from row pruning appears to be relatively small compared to the size of the standard deviations in effort estimation data. Secondly, the advantages of row pruning especially for the purposes of deleting spurious outliers can be achieved using column pruning much more effectively. Hence, we advise against row pruning and advocate column pruning instead.
Machine recognition of hand-drawn circuit diagrams
Authors: B. Edwards
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

An application of image processing techniques to recognition of hand-drawn circuit diagrams is presented. The scanned image of a diagram is pre-processed to remove noise and converted to bilevel. Morphological operations are applied to obtain a clean, connected representation using thinned lines. The diagram comprises of nodes, connections and components. Nodes and components are segmented using appropriate thresholds on a spatially varying object pixel density. Connection paths are traced using a pixel-stack. Nodes are classified using syntactic analysis. Components are classified using a combination of invariant moments, scalar pixel-distribution features, and vector relationships between straight lines in polygonal representations. A node recognition accuracy of 82% and a component recognition accuracy of 86% was achieved on a database comprising 107 nodes and 449 components. This recogniser can be used for layout "beautification" or to generate input code for circuit analysis and simulation packages.
A Collaborative Inter Data Grids Strong Semantic Model with Hybrid Namespace
Authors: Dalia El-Mansy, Ahmed Sameh
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The intention is to design a hybrid namespace collaboration model for existing organizations to pay lower cost (initial and running) in order to join it. Data resources will be allowed to have colliding names. The contributing organization will be free to set any rules for its internal users to follow (such as taxonomy). However, it will have to take care of a very simple interface to the intended model in order to introduce new contributed resources or to query external ones. Traditional data grids will join this model (represented by proxy agents) to provide their content while their owners can join as users of relevant servers to explore relevant resources to keep their content up to date. A hierarchical namespace will be maintained in order to uniquely identify data resources. (Full names are the local names prefixed with the ID of owner data grid for uniqueness.) If the full name is queried, the corresponding resource is sought in the wide group of collaborating data grids. If the local name is queried, it is fetched in the local data grid. Similar and related topics in different places in the hierarchy will be linked for robustness. Otherwise, a comprehensive search should be performed all over the whole hierarchy.
Emily: A High Performance Language for Enabling Secure Cooperation
Authors: Marc Stiegler
Venue: Proceedings of the Fifth International Conference on Creating, Connecting and Collaborating through Computing (2007)

Well-designed security is required to enable cooperation with strangers and enemies. A number of prototype and experimental systems have demonstrated that object-capability programming languages can blend security with cooperation with little impact on programmer or user behavior. However, heretofore all programming languages in the object-capability family have had inadequate performance for many projects, leading programmers to use languages such as C++. We present Emily, a language with performance characteristics similar to those of C++, but with secure cooperation support that emerges from the enforcement of the Principle of Least Authority (POLA).
A Study on Reliability in Graph Discovery
Authors: Honghua Dai
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

A critical question in data mining is that can we always trust what discovered by a data mining system unconditionally? The answer is obviously not. If not, when can we trust the discovery then? What are the factors that affect the reliability of the discovery? How do they affect the reliability of the discovery? These are some interesting questions to be investigated. In this paper we will firstly provide a definition and the measurements of reliability, and analyse the factors that affect the reliability. We then examine the impact of model complexity, weak links, varying sample sizes and the ability of different learners to the reliability of graphical model discovery. The experimental results reveal that (1) the larger sample size for the discovery, the higher reliability we will get; (2) the stronger a graph link is, the easier the discovery will be and thus the higher the reliability it can achieve; (3) the complexity of a graph also plays an important role in the discovery. The higher the complexity of a graph is, the more difficult to induce the graph and the lower reliability it would be.
Robust and fair trading in volatile environments: overcoming technical problems and uncooperativeness
Authors: K. Hahn, J. Böse, Birgitta König-Ries, Philipp Obreiter
Venue: Proceedings of the 6th ACM international workshop on Data engineering for wireless and mobile access (2007)

The exchange of electronic information, goods or functionality is an attractive application for mobile ad-hoc networks. However, users will only take part in such systems, if the probability of a successful exchange is high enough. Exchanges may fail either because of communication failures or due to unfair behavior. Both obstacles need to be overcome to achieve a viable system. Existing approaches tend to address one or the other of the problems, ignoring the second one. In contrast, we present an integrated approach and argue that this is more powerful than two isolated solutions. Replicated transaction logs are used to overcome disconnection periods and an evidence-based distributed reputation system is used to encourage fair behavior. The concepts are implemented as middle-ware components and thoroughly evaluated. The evaluation shows that the system is viable in a wide range of realistic settings.
Decoding doodles: novice programmers and their annotations
Authors: Jacqueline Whalley, Christine Prasad, P. K. Ajith Kumar
Venue: Proceedings of the ninth Australasian conference on Computing education - Volume 66 (2007)

This paper reports on the annotations made by novice programming students on an exam script. We investigate the level of reasoning that the students achieve when answering a short answer question using the SOLO taxonomy and relate this to the type and number of annotations they made. The questions and annotations were classified and the relationship between question type, student performance and the tendency to annotate was explored.
Visualisation of Network Traffic using Dynamic Co-occurrence Matrices
Authors: Thorsten Kisner, Alex Essoh, Firoz Kaderali
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

Traffic visualisation is important in several areas e.g. network planning and monitoring, network traffic analysis and intrusion detection. A novelty in the work we present in this paper is the use of texture analysis methods from the domain of digital image processing for network traffic visualisation. We use strategies based on co-occurrence matrices to derive statistical properties for network traffic visualisation and anomalous traffic detection. Based on the fact that some of the statistical properties are related to a certain kind of traffic, which is also reflected in the allocation of the dynamic co-occurrence matrix, we are able to display the global status of our network and show periods, where the traffic behaviour is unusual. Further, we introduce a new parameter, Network Traffic Homogeneity (NTH) as ameasure of the local roughness of the network traffic.