ppxscal/embedding_network huggingface dataset:
Computational applications of noise sensitivity
Authors: Ryan William O'Donnell
Venue:  (2003)

This thesis is concerned with the study of the noise sensitivity of boolean functions and its applications in theoretical computer science. Noise sensitivity is defined as follows: Let f be a boolean function and let &epsi; &isin; (0, &half;) be a parameter. Suppose a uniformly random string x is picked, and y is formed by flipping each bit of x independently with probability &epsi;. Then the noise sensitivity of f at &epsi; is defined to be the probability that f(x) and f (y) differ. In this thesis we investigate the noise sensitivity of various classes of boolean functions, including majorities and recursive majorities, boolean threshold functions, and monotone functions. Following this we give new complexity-theoretic and algorithmic applications of noise sensitivity: (1) Regarding computational hardness amplification, we prove a general direct product theorem that tightly characterizes the hardness of a composite function g &otimes; f in terms of an assumed hardness of f and the noise sensitivity of g. The theorem lets us prove a new result about the hardness on average of NP: If NP is (1 &minus; poly(n))-hard for circuits of polynomial size, then it is in fact (&half; + o(1))-hard for circuits of polynomial size. (2) In the field of computational learning theory, we show that any class whose functions have low noise sensitivity is efficiently learnable. Using our noise sensitivity estimates for functions of boolean halfspaces we obtain new polynomial and quasipolynomial time algorithms for learning intersections, thresholds, and other functions of halfspaces. From noise sensitivity considerations we also give a polynomial time algorithm for learning polynomial-sized DNFs under the &ldquo;Random Walk&rdquo; model; we also give the first algorithm that learns the class of &ldquo;junta&rdquo; functions with efficiency better than that of the brute force algorithm. (3) Finally, we introduce a new collective coin-flipping problem whose study is equivalent to the study of &ldquo;higher moments&rdquo; of the noise sensitivity problem. We prove several results about this extension, and find optimal or near-optimal choices for the coin-flipping function for all asymptotic limits of the parameters. Our techniques include a novel application of the reverse Bonami-Beckner inequality. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
A Note on Vertex List Colouring
Authors: P. E. Haxell
Venue: Combinatorics, Probability and Computing (2001)

Let k be a positive integer and let G be a graph. Suppose a list S(v) of positive integers is assigned to each vertex v, such that(1) &#x2223;S(v)&#x2223; = 2k for each vertex v of G, and(2) for each vertex v, and each c &isin; S(v), the number of neighbours w of v for which c &isin; S(w) is at most k.Then we prove that there exists a proper vertex colouring f of G such that f(v) &isin; S(v) for each v &isin; V(G). This proves a weak version of a conjecture of Reed.
Who Profits from Knowledge Management?: A Case of Experience versus Expertise
Authors: Dong-Gil Ko, Alan R. Dennis
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Although many organizations are implementing knowledge management systems (KMS), there is little empirical evidence about whether KMS use by varying levels of experience and expertise can improve individual and organization performance. In this study, we examined the impact of using a codification-based KMS on the sales performance of 1,340 sales representatives in a pharmaceutical firm. We found that KMS use was directly related to performance -- the more knowledge assets that sales representatives read, the more likely they were to exceed their quota. Experience and expertise moderated this relationship.Inexperienced sales representatives who exceeded their sales quota in the previous year derived significantly greater benefit from KMS use than did other sales representatives. Experienced sales representatives who failed to reach their sales quota in the previous year derived significantly less benefit from KMS use than did other sales representatives.
Accelerating Bounded Model Checking of Safety Properties
Authors: Ofer Strichman
Venue: Formal Methods in System Design (2004)

Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search for a counterexample in executions whose length is bounded by some integer k. The BMC problem can be efficiently reduced to a propositional satisfiability problem, and can therefore be solved by SAT methods rather than BDDs. SAT procedures are based on general-purpose heuristics that are designed for any propositional formula. We show how the unique characteristics of BMC invariant formulas (Gp) can be exploited for a variety of optimizations in the SAT checking procedure. Experiments with these optimizations on real designs prove their efficiency in many of the hard test cases, in comparison to both the standard SAT procedure and a BDD-based model checker.
Collective stochastic versions of playable games as metaphors for complex biosystems: team connect four
Authors: Il'Ya Safro, Lee Segel
Venue: Complexity (2003)

In an effort to better understand complex biological systems, the game "Connect Four" is generalized to be a stochastic contest between two teams. Members of each team typically possess "sensors" that provide some information on the nearby deployment of the pieces. Sensing something interesting increases the probability that a given team member will move. Simulations show the relative strengths of various sensor weightings and thereby cast some light on the use of sensors in more general complex autonomous systems.
Design of secure cryptography against the threat of power-attacks in DSP-embedded processors
Authors: Catherine H. Gebotys
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2004)

Embedded wireless devices require secure high-performance cryptography in addition to low-cost and low-energy dissipation. This paper presents for the first time a design methodology for security on a VLIW complex DSP-embedded processor core. Elliptic curve cryptography is used to demonstrate the design for security methodology. Results are verified with real dynamic power measurements and show that compared to previous research a 79&percnt; improvement in performance is achieved. Modification of power traces are performed to resist simple power analysis attack with up to 39&percnt; overhead in performance, up to 49&percnt; overheads in energy dissipation, and up to 11&percnt; overhead in code size. Simple power analysis on the VLIW DSP core is shown to be more correlated to routine ordering than individual instructions. For the first time, differential power analysis results on a VLIW using real power measurements are presented. Results show that the processor instruction level parallelism and large bus size contribute in making differential power analysis attacks extremely difficult. This research is important for industry since efficient yet secure cryptography is crucial for wireless communication devices.
Communication characteristics of large-scale scientific applications for contemporary cluster architectures
Authors: Jeffrey S. Vetter, Frank Mueller
Venue: Journal of Parallel and Distributed Computing (2003)

This paper examines the explicit communication characteristics of several sophisticated scientific applications, which, by themselves, constitute a representative suite of publicly available benchmarks for large cluster architectures. By focusing on the message passing interface (MPI) and by using hardware counters on the microprocessor, we observe each application's inherent behavioral characteristics: point-to-point and collective communication, and floating-point operations. Furthermore, we explore the sensitivities of these characteristics to both problem size and number of processors. Our analysis reveals several striking similarities across our diverse set of applications including the use of collective operations, especially those collectives with very small data payloads. We also highlight a trend of novel applications parting with regimented, static communication patterns in favor of dynamically evolving patterns, as evidenced by our experiments on applications that use implicit linear solvers and adaptive mesh refinement. Overall, our study contributes a better understanding of the requirements of current and emerging paradigms of scientific computing in terms of their computation and communication demands.
Handling device diversity through multi-level stylesheets
Authors: Walter Dees
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

With the advent of in-home networking and ubiquitous computing, it becomes apparent that we have an increasing need for automatic adaptation of user interfaces to different devices. Many of the techniques to date, have been focusing on making abstract models of the user interface in order to accommodate for a wide range of target devices. However, generating a user interface from only abstract models may result in unattractive and possibly unusable user interfaces. There is a need for navigation and styling attributes that match the characteristics of the target device. Typically, a style-sheet, a presentation model, or a tailor-made adaptation engine is needed for every possible target device. To not have to do that (in full detail) for every possible target device now and in the future, and to support run-time migration of user interfaces, we propose a technique called "multi-level stylesheets". This technique involves specifying style attributes on different levels of abstraction. This enables the re-use of style information for different devices, and will enable the automatic generation of not only usable, but also more attractive user interfaces.
Problems in operational and systems analysis educational process: solved by ICT application
Authors: Martina Berankova, Petra Nevrivova
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

The ICT application will cultivate new methods, with a possibility to be used in all subjects. It will contain influences from inside and outside the faculty or university. To study methods of operational and systems analysis is very difficult for students, most of themes are hard to understand and need a lot of examples to practice. The scheme for the application ICT is in the form of a global decision procedure and for the selected neighborhood. One part of this application is the creation of the Virtual personality. This Virtual personality is able to quickly correct and accurately specify types of exercises at any time. It can also recommend further literature to the user who wants to improve his results.The ICT application within education has shown changes in communication among teachers, student and education institution administrations. This suggested tool will be a part of virtual education at the Faculty of Economics and Management at the Czech University of Agriculture in Prague. There is an influence of quality and form in every part of the educational process by ICT. It is going to be supported and the leap component on the free market within education.
Should Start-up Companies Be Cautious? Inventory Policies Which Maximise Survival Probabilities
Authors: T. W. Archibald, L. C. Thomas, J. M. Betts, R. B. Johnston
Venue: Management Science (2002)

New start-up companies, which are considered to be a vital ingredient in a successful economy, have a different objective than established companies: They want to maximise their chance of long-term survival. We examine the implications for their operating decisions of this different criterion by considering an abstraction of the inventory problem faced by a start-up manufacturing company. The problem is modelled under two criteria as a Markov decision process; the characteristics of the optimal policies under the two criteria are compared. It is shown that although the start-up company should be more conservative in its component purchasing strategy than if it were a well-established company, it should not be too conservative. Nor is its strategy monotone in the amount of capital it has available. The models are extended to allow for interest on investment and inflation.
The Blow-up Lemma
Authors: János Komlós
Venue: Combinatorics, Probability and Computing (1999)

Extremal graph theory has a great number of conjectures concerning the embedding of large sparse graphs into dense graphs. Szemer&eacute;di's Regularity Lemma is a valuable tool in finding embeddings of small graphs. The Blow-up Lemma, proved recently by Koml&oacute;s, S&aacute;rk&ouml;zy and Szemer&eacute;di, can be applied to obtain approximate versions of many of the embedding conjectures. In this paper we review recent developments in the area.
CUTEr and SifDec: A constrained and unconstrained testing environment, revisited
Authors: Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint
Venue: ACM Transactions on Mathematical Software (TOMS) (2003)

The initial release of CUTE, a widely used testing environment for optimization software, was described by Bongartz, et al. [1995]. A new version, now known as CUTEr, is presented. Features include reorganisation of the environment to allow simultaneous multi-platform installation, new tools for, and interfaces to, optimization packages, and a considerably simplified and entirely automated installation procedure for unix systems. The environment is fully backward compatible with its predecessor, and offers support for Fortran 90/95 and a general C/C++ Application Programming Interface. The SIF decoder, formerly a part of CUTE, has become a separate tool, easily callable by various packages. It features simple extensions to the SIF test problem format and the generation of files suited to automatic differentiation packages.
Lessons Learned from Software Engineering Multi-Agent Systems
Authors: David C. Kung, Hitesh Bhambhani, Sheila Nwokoro, Wesam Okasha, Ravindra Kambalakatta, Praveen Sankuratri
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

The popularity of agent-based systems has increasedrapidly in recent years. A number of software engineeringframeworks/methodologies have been proposed to supportmulti-agent systems construction. How well are softwareengineering methodologies in support of multi-agentsystems development? What are the strengths and weaknessesof such attempts? In this paper, we report our experiencefrom the application of a software engineering frameworkfor multi-agent systems. The framework is rooted inthe Belief Desire Intention (BDI) formalism and an extensionof the Unified Modeling Language (UML). Our focusis to present lessons learned by applying this framework toan agent-based intelligent elevator system. We also identifysome research issues.
Application-tuned processor architectures
Authors: Timothy Peter Sherwood
Venue:  (2003)

The performance and resource requirements of every application are unique. Yet most processors are designed to do well, not on a particular application, but instead on the average case over a range of applications. Processors are typically designed around a broad suite of applications so that one piece of hardware can be used in many different contexts. In contrast to this, the continuing expansion of the embedded market has created a significant demand for low-cost high-performance computing solutions that can be buried deep inside products. These embedded processors are typically responsible for the execution of only a small number of applications, which means that it is possible to tune the design of the processor to the needs of the application for which it will be used. Embedded processors not only typically execute a small number of applications, they are also often integrated into the same physical chip as many other components. This level of integration means that the processors are now being sold not as physical silicon, but rather as descriptions which can be combined with other design elements before fabrication. This change in the way that processors are sold provides us with an opportunity to take into consideration specific application behaviors during the physical design of the processor. By customizing a processor to the needs of an application, we can provide faster designs that take less area. In order to make this possible, the customization needs to be realized with a minimum of additional engineering design effort. To this end, this dissertation focuses on novel automated techniques for analyzing program behavior, customizing portions of the processor to an application, making intelligent design tradeoffs, and examining the effect of algorithmic choices on the circuit level realities of their implementation.
Proceedings of the 2003 conference on Universal usability
Venue: ACM Conference on Universal Usability (2003)

Organising the technical program for this the second Conference on Universal Usability has been an exciting and rewarding experience. During the early stages of the review process, we were concerned that circumstances way beyond our control (war, SARS etc) were going to have a seriously deleterious effect on submissions and the conference itself. Thus it was most pleasing and reassuring when we received over sixty submissions from which we were able to select nineteen full papers, one panel and four posters.
Understanding Customer Trust in Agent-Mediated Electronic Commerce, Web-Mediated Electronic Commerce, and Traditional Commerce
Authors: Sherrie Xiao Komiak, Izak Benbasat
Venue: Information Technology and Management (2004)

Customer trust is important in agent-mediated electronic commerce, web-mediated electronic commerce, and traditional commerce. However, the meaning of customer trust in these contexts has not been clearly defined or fully delineated. This paper proposes a new trust model that differentiates between cognitive trust and emotional trust, defines customer trust in each type of commerce as cognitive trust and emotional trust in the various entities (e.g., website, computer agent) that make up a commerce context, and then compares customer trust across the three types of commerce. We propose that, first, emotional trust merits research, particularly in e-commerce. Second, both awareness of the known and awareness of the unknown will be higher in e-commerce than in traditional commerce; this will lead to lower cognitive trust and emotional trust in e-commerce. Third, the key to increase customer trust in e-commerce is to design and develop technologies to reduce the distance between a customer and each entity, thereby increasing awareness of the known and decreasing awareness of the unknown. Fourth, cognitive trust and emotional trust fall along a continuum with potentially asymmetric effects on customer dependence on entities in e-commerce (e.g., computer agent adoption). Finally, future research on customer trust in e-commerce is outlined.
PACO++: A Parallel Object Model for High Performance Distributed Systems
Authors: Christian Pérez, Thierry Priol, André Ribes
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

The availability of high bandwidth wide area networks enables the coupling of several computing resources -- supercomputers or PC clusters -- together to obtain a high performance distributed system. The question is to determine a suitable programming model that provides transparency, interoperability, reliability, scalability and performance. Since such systems appear as a combination of distributed and parallel systems, it is tempting to extend programming models that were associated to distributed or to parallel systems.Another choice is to combine the two different worlds into a single coherent one. A parallelism oriented model appears more adequate to program parallel codes while a distributed oriented model is more suitable to handle inter-code communications. This issue is addressed with the concept of parallel object. We have applied it to CORBA so as to define a parallel CORBA object: it is a collection of identical CORBA objects with a Single Program Multiple Data (SPMD) execution model.This paper presents PACO++, a portable implementation of the concept of parallel CORBA object. It examines how the different design issues have been tackled with. For example, scalability is achieved between two parallel CORBA objects by involving all members of both collections in the communication: an aggregated bandwidth of 874 Mbit/s has been obtained on a 1 Gbit/s WAN. Such a performance is obtained while preserving the semantics of CORBA and in particular interoperability with standard CORBA objects.
Integrating Knowledge Management Systems with Everyday Work: Design Principles Leveraging User Practice
Authors: Dick Stenmark, Rikard Lindgren
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Much research argues that information technology can have a positive influence on knowledge application. However, practical results from research on knowledge managementsystems indicate that such systems often fail when implemented in contemporary organizations. Whilst maintenance of knowledge management systems has been recognized as an important research area, imbalance between additional workload and accurate content still appears to be a critical factor, resulting in systems of little use for organisations in their knowledge application processes. The objective of this paper is to demonstrate how knowledge management systems can be designed to better support knowledge application inorganizational knowledge work processes. Building on lessons learned from three knowledge management systems, this paper contributes general design principles describing how knowledge management systems can be integrated with everyday work to leverage user practices.
Topics in complex analysis and function spaces
Authors: Mark Robert Hoffmann
Venue:  (2003)

There are three parts of this work. In the first part we give an explicit computation of the Banach envelope for non-locally convex Paley-Wiener type spaces. In the second part we develop more general tools for the treatment of harmonic and analytic functions which take values in a quasi-Banach space. We are able to give a description of boundary value functions for the classes Hs&parl0;C +,X&parr0; . Our results extend the well known case of scalar valued functions on the disc and the half plane. The third part is joint work with Nigel Kalton and Tamara Kucherenko. It is shown that R-bounded and weakly compact semigroups on L1 and C(K) can only exist for &ell;1 and c0. More generally, R-bounded weakly compact commuting approximating sequences in Banach spaces are discussed.
Watermelon uniform random generation with applications
Authors: Nicolas Bonichon, Mohamed Mosbah
Venue: Theoretical Computer Science (2003)

Watermelons are particular configurations of vicious walkers. In these configurations, each path starts and ends at the same ordinate. We present a simple uniform random generation algorithm of watermelons based on enumeration formulas of star configurations (with or without a wall). The performance of this algorithm is better than earlier ones in the case of watermelons with few walkers.Using appropriate bijections, these algorithms can also generate underdiagonal paths, realizers (or Schnyder Trees), twin parallelogram polyominoes according to their perimeter and width, Baxter permutations according to the number of rises, etc. Moreover, we present some experimental results on the height of watermelons and realizers.