ppxscal/embedding_network huggingface dataset:
Managing complexity in TeamRooms, a Tcl-based internet groupware application
Authors: Mark Roseman
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

This paper describes TeamRooms, a Tcl-based real time groupware application that provides "network places" for users to collaborate. TeamRooms is significantly more complex than previous groupware applications, providing not only generic tools such as shared whiteboards, but also custom groupware applets running within an OpenDoc-style embedded window. As well as describing TeamRooms itself, the paper relates the use of several Tcl programming techniques -- meta-architectures, multiple interpreters, and embedded windows -- that are used to manage the resulting complexity of the system.
Analyzing Online Information Privacy Concerns: An Information Processing Theory Approach
Authors: Il-Horn Hann, Kai-Lung Hui, Sang-Yong Tom Lee, Ivan P. L. Png
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The advent of the Internet has made the transmission of personally identifiable information common and often inadvertent to the user. As a consequence, individuals worry that companies misuse their information. Firms have tried to mitigate this concern in two ways: (1) offering privacy policies regarding the handling and use of personal information, (2) offering benefits such as financial gains or convenience. In this paper, we interpret these actions in the context of the information processing theory of motivation. Information processing theories, in the context of motivated behavior also known as expectancy theories, are built on the premise that people process information about behavior-outcome relationships. We empirically validate predictions that the means to mitigate privacy concerns are associated with positive valences resulting in an increase in motivational score. Further, we investigate these means in trade-off situation, where a firm may only offer partially complete privacy protection and/or some benefits.
A recursive prediction error algorithm for identification of certain time-varying nonlinear systems
Authors: A. E. Nordsjo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The tracking problem in identification of certain classes of time-varying nonlinear systems is addressed. In particular, a Hammerstein type system which consists of a nonlinear part, given on a state space description, followed by a time-varying linear part is considered. A recursive prediction error method, RPEM combined with a method for on-line adjustment of the forgetting factor is proposed. This algorithm does not require estimation of the statistics of the noise and the dynamics of the true system. It is shown how the proposed scheme can be used for identification of certain nonlinear time-varying acoustic echo paths. Thus, the suggested algorithm is applicable to for instance, conference telephony and mobile telephone handsfree.
Parallel-beams/lever electrothermal out-of-plane actuator
Authors: S. Deladi, G. Krijnen, M. C. Elwenspoek
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

We report on the design, modeling, fabrication and testing of a new electrothermal actuator allowing for various modes of movement and exhibiting large enough forces to be usable in a micro-tribotester. The performance of the actuator has been simulated combining numerical and analytical calculations. Experiments have been performed in ambient conditions and vacuum. The theoretical results and measurements are consistent if the temperature dependence of the properties of the polycrystalline Si is taken into account.
A Formal Contract Language for Plugin-based Software Engineering
Authors: Jens Dietrich, John Hosking, Jonathan Giles
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

Plugin-based application design has become increasingly popular in recent years, and has contributed to the success of a range of very different applications including Mozilla Firefox and the Eclipse development environment. Using plugins is a promising approach to build complex systems that have to be reconfigured at runtime, and several plugin based general purpose runtime environments are currently under development. Plugin-based design is based on the idea that plugins provide additional functionality extending the capabilities of a core product. While this is often understood as providing services by implementing abstract classes or interfaces defined in the core product, modern plugin-based systems like Eclipse use a much wider definition of service. We propose to consider these services as typed resources and introduce a contract language that can be used to define contracts between plugins providing and consuming services. This language is based on the SemanticWeb Rule Language (SWRL) that has a well-defined syntax and semantics. These contracts can then be used in order to validate complex, plugin-based applications.
We need multiple solutions for electric equipments configuration in a power plant - applying Bayesian optimization algorithm with Tabu search
Authors: Y. Katsumata, S. Kurahashi, T. Terano
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper addresses electric equipments configuration problems in a power plant. The problems are large-scale nonlinear combinatorial optimization problems with various constraints. In this paper, we apply Bayesian optimization algorithm with Tabu search (Tabu-BOA) to the problems. From intensive experiments, the proposed method has shown the effectiveness to practical problems.
Packet error rate and throughput estimation for link adaptation in wireless local area networks
Authors: H. Shafiee, M. Khoshgard
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

In this paper, a link adaptation technique based on constellation error power per sub-carrier for an OFDM communication system is described. The algorithm is based on the estimation of signal to noise ratio for each sub-channel, from which estimates for the overall symbol error rate for different modulation modes are obtained. Next, taking the operation of the Viterbi decoder into account, an estimate of the packet error rate (PER) is found for each case. The actual throughput rate for each transmission mode can then be computed for a given length of the packet. The estimates for PER as well as throughput rate can be used to select a suitable transmission mode as well as the length of fragments.
A new pipelined implementation for minimum norm sorting used in square root algorithm for MIMO-VBLAST systems
Authors: Zahid Khan, Tughrul Arslan, John S. Thompson, Ahmet T. Erdogan
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Multiple Input - Multiple Output (MIMO) wireless technology involves highly complex vectors and matrix computations which are directly related to increased power and area consumption. This paper proposes an area and power efficient VLSI architecture that can serve the dual purpose of minimum norm sorting of rows as well as upper/lower block tri-angularization of matrices. The resources inside the architecture are shared among both operations and only primitive computations are used. Results indicate saving in silicon real estate as well as power consumption compared to previous architecture without degrading performance.
Sets of type-(1,n) in symmetric designs for λ≥3
Authors: Sang-Mok Kim
Venue: European Journal of Combinatorics (2007)

A set of type-(m,n)S is a set of points of a design with the property that each block of the design meets either m points or n points of S. The notions of type and of parameters of a k-set (there called characters) were introduced for the first time by Tallini Scafati in [M. Tallini Scafati, {k,n}-archi di un piano grafico finito, con particolare riguardo a quelli con due caratteri. Note I and Note II, Rend. Accad. Naz. Lincei 40 (8) (1996) 812-818 (1020-1025)]. If m=1, S gives rise to a subdesign of the design. Under weaker conditions for the order of each symmetric design, the parameters of sets of type-(1,n) in projective planes were characterised by G. Tallini and the biplane case was dealt with by S. Kim, by solving the corresponding Diophantine equation for each case, separately. In this paper, we first characterise the parameters of sets of type-(1,n) in the triplane with more generalised order conditions than prime power order. Next, we generalise the result on triplanes to arbitrary symmetric designs for @l>=3. As results, a non-existence condition for special parameter sets and a characterisation of parameters for the existence, restricted by some derived bounds, are given.
Discrete Orthogonal Decomposition and Variational Fluid Flow Estimation
Authors: Jing Yuan, Christoph Schnörr, Etienne Mémin
Venue: Journal of Mathematical Imaging and Vision (2007)

We exploit the mimetic finite difference method introduced by Hyman and Shashkov to present a framework for estimating vector fields and related scalar fields (divergence, curl) of physical interest from image sequences. Our approach provides a basis for consistent definitions of higher-order differential operators, for the analysis and a novel stability result concerning second-order div-curl regularizers, for novel variational schemes to the estimation of solenoidal (divergence-free) image flows, and to convergent numerical methods in terms of subspace corrections.
Bias-free adaptive IIR filtering
Authors: Woo-Jin Song
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We present a new family of algorithms that solve the bias problem in the equation-error based adaptive infinite impulse response (IIR) filtering. A novel constraint, called the constant-norm constraint, unifies the quadratic constraint and the monic one. By imposing the monic constraint on the mean square error (MSE) optimization, the merits of both constraints are inherited and the shortcomings are overcome. A new cost function based on the constant-norm constraint and Lagrange multiplier is defined. Minimizing the cost function gives birth to a new family of bias-free adaptive IIR filtering algorithms. For example, three efficient algorithms belonging to the family are proposed. The analysis of the stationary points is presented to show that the proposed methods can indeed produce bias-free parameter estimates in the presence of noise. The simulation results demonstrate that the proposed methods perform better than existing algorithms, while being very simple both in computation and implementation.
You're Recommending What?!
Authors: Norman Chonacky
Venue: Computing in Science and Engineering (2007)

EIC Norman Chonacky explains what new technologies readers can expect thanks to the magazine's recent editorial board meeting.
Database Replication with Availability and Consistency Guarantees through Failure-Handling
Authors: Morteza Abbaszadeh Meinagh, Ayaz Isazadeh, Mehdi Ayar, Fariborz Mahmoudi, Bagher Zareie
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

In this paper we present an approach to fault-tolerant stream processing. In contrast to previous techniques that handle node failures, our approach also tolerates network failures and network partitions. The approach is based on a principled trade-off between consistency and availability in the face of failure, that (1) ensures that all data on an input stream is processed within a specified time threshold, but (2) reduces the impact of failures by limiting if possible the number of results produced based on partially available input data, and (3) corrects these results when failures heal. Our approach is well-suited for applications such as environment monitoring, where high availability and "real-time" response is preferable to perfect answers. Our approach uses replication and guarantees that all processing replicas achieve state consistency, both in the absence of failures and after a failure heals. We achieve consistency in the former case by defining a data-serializing operator that ensures that the order of tuples to a downstream operator is the same at all the replicas. To achieve consistency after a failure heals, we develop approaches based on checkpoint/redo and undo/redo techniques.
Effects of property ordering in an incremental formal modeling methodology
Authors: Syed Suhaib, Deepak Mathaikutty, Sandeep Shukla
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

In this paper, we analyze the effect of ordering linear time properties while using the Extreme Formal Modeling (XFM) methodology in building "prescriptive formal models" (PFM). PFMs are formal models built incrementally by adding user stories and are used as specification golden models. In our methodology, the user stories are captured in Linear Time Temporal Logic (LTL). A more expressive logic or formalism could be used for describing the user stories as well. During incremental model building, the PFMs often blow up in size in terms of the state space, and the main tenet of XFM being regressive model checking, blown up models often make it impossible to carry out the XFM methodology. Here, we propose property ordering hueristics to circumvent this problem. We compare these hueristics with: (i) no specific ordering of user stories (standard approach), (ii) sorting of the user stories based on a weighting scheme (property based sorting), and (Hi) predicate based sorting of user stories based on an eliminative scheme (predicate based sorting). We show that the predicate based sorting scheme is the most effective way to carry-out XFM model building. We illustrate the schemes and the comparison by modeling a monitor for the ISA bus and for the arbitration phase of Pentium Pro processor's bus using the Cadence SMV. We also provide an algorithm for the predicate based sorting that yields the best control on the increments in model size.
Magpie: online modelling and performance-aware systems
Authors: Paul Barham, Rebecca Isaacs, Richard Mortier, Dushyanth Narayanan
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

Understanding the performance of distributed systems requires correlation of thousands of interactions between numerous components -- a task best left to a computer. Today's systems provide voluminous traces from each component but do not synthesise the data into concise models of system performance. We argue that online performance modelling should be a ubiquitous operating system service and outline several uses including performance debugging, capacity planning, system tuning and anomaly detection. We describe the Magpie modelling service which collates detailed traces from multiple machines in an e-commerce site, extracts request-specific audit trails, and constructs probabilistic models of request behaviour. A feasibility study evaluates the approach using an offline demonstrator. Results show that the approach is promising, but that there are many challenges to building a truly ubiquitious, online modelling infrastructure.
Digital Consumer Networks and Producer-Consumer Collaboration: Innovation and Product Development in the Digital Entertainment Industry
Authors: Reina Y. Arakji, Karl R. Lang
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper examines new forms of collaboration between producers and consumers that are emerging in the digital entertainment space. Taking the case of the video-game industry, we show how firms have successfully engaged in outsourcing parts of their game design and development process to digital consumer networks. Applying economic analysis, we explore the potential benefits to both producers and consumers. We also discuss implications with respect to copyright enforcement on firm strategy for innovation. We finally indicate potential research areas in producer-consumer collaboration for innovation in general and in the music and moving image industries in particular, the value of digital consumer networks, as well as the effect of outsourcing to consumers on social surplus and the boundary of the firm.
Test Pattern Generation Using Modulation by Haar Wavelets and Correlation for Sequential BIST
Authors: Suresh Kumar Devanathan, Michael L. Bushnell
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

We propose a sequential built-in self-test (BIST) hardware pattern generator using Haar wavelets, linear feedback shift registers (LFSRs), modulation, correlation and biasing hardware that produces higher fault efficiencies (FEs) than existing sequential BIST methods. We generate random bit sequences for primary inputs (PIs), which are modulated by Haar wavelets. Our correlator may substitute a highly-correlated PI bit stream for the actual bit stream for this PI. Finally, the bit stream is biased toward a particular probability of generating a 1 input before being fed to the PI. Results on ISCAS '89 benchmarks show that this BIST method produces 96.77% FE for circuits without resettable flip-flops, and 99.41% (upper-bound) FE, for those with resettable flip-flops. Upadhyayula and Bushnell [16] only attained 81.4% FE. Our method is implemented in hardware as opposed to Giani et al. [9] who have systemon- a-chip (SoC) implementations that require an on-board microprocessor and cannot perform at-speed test. Our hardware overhead is 9.01%, much less than Giani et al.'s method. Compared to Pomeranz and Reddy's work [14], we achieved 95.69% FE, compared with 95.01% for them, and on the circuits where they presented results, we have 66.3% hardware overhead versus 234.1% for them.
Faculty mentoring and failure case studies in civil engineering education
Authors: N. J. Delatte
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

This paper describes a four-year faculty mentored undergraduate research experience in integrating failure case studies in civil and environmental engineering education. A freshman undergraduate student has been teamed with a University of Alabama at Birmingham (USA) assistant professor to undertake research in this area. As the student proceeds through the civil engineering curriculum, she will work with the faculty mentor to identify failure case studies that illustrate the teaching points of the courses. The research experience will encompass 33 hours per quarter for the three academic quarters during the year, as well as 20 hours per week during the summer. 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
A new approach for measuring rule set consistency
Authors: Johan Huysmans, Bart Baesens, Jan Vanthienen
Venue: Data Knowledge Engineering (2007)

Various algorithms are capable of learning a set of classification rules from a number of observations with their corresponding class labels. Whereas the obtained rule set is usually evaluated by measuring its accuracy on a number of unseen examples, there are several other evaluation criteria, such as comprehensibility and consistency, that are often overlooked. In this paper we focus on the aspect of consistency: if a rule learner is applied several times on the same data set, will it provide rule sets that are similar over the different runs? A new measure is proposed and various examples show how this new measure can be used to decide between different algorithms and rule sets or to find out whether the rules in a knowledge base need to be updated.
High-performance FPGA filters using sigma-delta modulation encoding
Authors: C. Dick
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This paper investigates an architectural option for constructing high sample-rate narrow-band single rate and multi-rate filters using Xilinx field programmable gate array (FPGA) technology. Sigma-delta modulation encoding is applied to the input data in order to effect a reduction in the precision of the arithmetic units in the filter. This is done without compromising the signal integrity within the band of interest. The implementation provides a significant savings in device logic resources in comparison to other techniques that provide the same functionality. The sigma-delta preprocessor is described and its implementation using XC4000 FPGAs is reported. The architecture of the reduced precision filter is presented and its FPGA realization described.
Near Optimal Protection Strategies Against Targeted Attacks on the Core Node of a Network
Authors: Frank Yeong-Sung Lin, Po-Hao Tsang, Yi-Luen Lin
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The issue of information security has attracted increasing attention in recent years. In network attack and defense scenarios, attackers and defenders constantly change their respective strategies. Given the importance of improving information security, a growing number of researchers are now focusing on how to combine the concepts of network survivability and protection against malicious attacks. As defense resources are limited, we propose effective resource allocation strategies that maximize an attacker's costs and minimize the probability that the "core node" of a network will be compromised, thereby improving its protection. The two problems are analyzed as a mixed, nonlinear, integer programming optimization problem. The solution approach is based on the Lagrangean Relaxation method, which solves this complicated problem effectively. We also evaluate the survivability of real networks, such as scale-free networks.
An Improved Shock Graph Approach for Shape Recognition and Retrieval
Authors: H. Zaboli, M. Rahmati
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Object recognition and shape matching are important issues in the field of image processing. Extraction and application of skeleton of a shape is widely used in these fields. In this paper shape matching and retrieval is performed using one of the skeleton-based methods called "shock graphs". By modifying and optimizing this method, results have been improved significantly, especially in the presence of occlusion and missing parts. In this extension, branch points are added as key points to the shock graph and its grammar and consequently a new grammar is developed. Our experimental results due to the modifications and extensions are presented with different examples and tests, especially in the presence of occlusion and missing parts.