ppxscal/embedding_network huggingface dataset:
New techniques for evaluating innovative interfaces with eye tracking
Authors: Sandra Marshall
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

Computer interfaces are changing rapidly, as are the cognitive demands on the operators using them. Innovative applications of new technologies such as multimodal and multimedia displays, haptic and pen-based interfaces, and natural language exchanges bring exciting changes to conventional interface usage. At the same time, their complexity may place overwhelming cognitive demands on the user. As novel interfaces and software applications are introduced into operational settings, it is imperative to evaluate them from a number of different perspectives. One important perspective examines the extent to which a new interface changes the cognitive requirements for the operator.This presentation describes a new approach to measuring cognitive effort using metrics based on eye movements and pupil dilation. It is well known that effortful cognitive processing is accompanied by increases in pupil dilation, but measurement techniques were not previously available that could supply results in real time or deal with data collected in long-lasting interactions. We now have a metric-the Index of Cognitive Activity-that is computed in real time as the operator interacts with the interface. The Index can be used to examine extended periods of usage or to assess critical events on an individual-by-individual basis.While dilation reveals when cognitive effort is highest, eye movements provide evidence of why. Especially during critical events, one wants to know whether the operator is confused by the presentation or location of specific information, whether he is attending to key information when necessary, or whether he is distracted by irrelevant features of the display. Important details of confusion, attention, and distraction are revealed by traces of his eye movements and statistical analyses of time spent looking at various features during critical event.Together, the Index of Cognitive Activity and the various analyses of eye movements provide essential information about how users interact with new interface technologies. Their use can aid designers of innovative hardware and software products by highlighting those features that increase rather than decrease users' cognitive effort.In the presentation, the underlying mathematical basis of the Index of Cognitive Activity will be described together with validating research results from a number of experiments. Eye movement analyses from the same studies give clues to the sources of increase in cognitive workload. To illustrate interface evaluation with the ICA and eye movement analysis, several extended examples will be presented using commercial and military displays. [NOTE: Dr. Marshall's eye tracking system will be available to view at Tuesday evening's joint UIST-ICMI demo reception.
Intangible determinants in the introduction and development of information technology: Mediterranean evidence
Authors: Ana R. del Águila, Sebastián Bruque, Antonio Padilla
Venue: Advanced topics in global information management (2003)

In a global and highly competitive context, the human-machine interaction re-emerges as an important topic of research among IS academics and practitioners. In this chapter, we propose an empirical analysis applied to the Pharmaceutical Distribution Industry in Spain, with the aim of detecting the influence that some human and managerial intangibles have on the level of effective implementation of IT in organizations. Finally, we present some theoretical and managerial implications that can be applied not only for the Spanish case, but also for the European Union and for a global environment.
Bulletproof business process automation: securing XML forms with document subset signatures
Authors: John M. Boyer
Venue: Proceedings of the 2003 ACM workshop on XML security (2003)

The standard unit of work in the business process is the electronic form, which includes complex user interface designs, data gathering and validation, wizard-like behaviors and spreadsheet computations. This paper reports state-of-the-art digital signature methods used to help provide security, non-repudiation and auditability within complex electronic forms applications. Both for financial reasons and for compliance with government regulations such as the Government Paper Elimination Act (GPEA), an ever-increasing number of intricate electronic forms applications are being created. Yet, there are aspects of paper-based systems that can only be modelled if digital signatures are able to omit carefully specified portions of a document so that certain restricted changes can be made after a signature is affixed. These scenarios occur frequently with electronic forms that are multiply signed and possibly involved in a non-trivial workflow process.Due to the importance of securing electronic forms and the complexities that can arise in signing them, the W3C XForms working group has placed integration with XML signatures among the highest priorities of its new standardization charter. However, there are security issues that must be addressed but which are beyond the core cryptographic capabilities of the W3C XML Signature Recommendation. This paper presents our research into and solutions for these issues. The purpose of this paper is to let successful industry experience and academic analysis provide guidance to future secure document standardization efforts (such as XForms) so that, even in the most demanding signature scenarios, the standards are still able to meet the fundamental requirement of digital signatures: What you see is what you sign.
Constant Coefficient Multiplication Using Look-Up Tables
Authors: Michael J. Wirthlin
Venue: Journal of VLSI Signal Processing Systems (2004)

Multiplication is an important but expensive operation in most FPGA-based signal processing systems. Many techniques have been introduced for reducing the size and improving the speed of FPGA-based multipliers. Constant-coefficient multipliers are an important class of such multipliers that reduce FPGA resource requirements by exploiting constant-specific optimizations. This paper reviews and analyzes a constant coefficient multiplier that exploits the fine-grain memory resources of FPGAs by performing table look-up. Several optimizations to this multiplier are introduced and analyzed. This paper will also introduce several techniques for reducing the resources of this multiplier by exploiting modern FPGA architectural enhancements.
Hybrid BIST Time Minimization for Core-Based Systems with STUMPS Architecture
Authors: Gert Jervan, Petru Eles, Zebo Peng, Raimund Ubar, Maksim Jenihhin
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approach, where a test set is assembled, for each core, from pseudorandom test patterns that are generated online, and deterministic test patterns that are generated offline and stored in the system. We propose a methodology to find the optimal combination of pseudorandom and deterministic test sets of the whole system, consisting of multiple cores, under given memory constraints, so that the total test time is minimized. Our approach employs a fast estimation methodology in order to avoid exhaustive search and to speed-up the calculation process. Experimental results have shown the efficiency of the algorithm to find near optimal solutions.
Symmetry formation principles of the chemical computer software
Authors: L. P. Schulz
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

A way leading from basic structural features in chemistry to chemical numbers and arithmetics has been shown One of the goals of this work was a query about conditions under which self-assemblage symmetries are formed and collapsed. It turns out that optimization through some criteria of quality results in the determination of specific symmetry datum-levels, leaving of which launches formation of chemically essential symmetry designs. The process can be measured due to fuzzy set based characteristics called overlapping and splitting that additionally detect collapses (catastrophes) of symmetries and chemical numbers to the very elementary forms. An enrichment of the chemical computer software has been achieved owing to novel relationships between structures underlying chemical processing and corresponding arithmetics of chemical numbers. Besides, certain mathematical groups have been specified for molecules of non-complex compounds.
The effect of workers with different capabilities on customer delay
Authors: Thomas Lee
Venue: Computers and Operations Research (2004)

Many service facilities operate seven days per week. The operations managers of these facilities face the problem of allocating personnel of varying skills and work speed to satisfy the demand for services. Furthermore, for practical reasons, periodic staffing schedule is implemented regularly. We introduce a novel approach for modeling periodic staffing schedule and analyzing the impact of employee variability on customer delay. The problem is formulated as a multiple server vacation queueing system with Bernoulli feedback of customers. At any point in time, at most one server can serve the customers. Each server incur a durations of set-up time before they can serve the customers. The customer service time and server set-up time may depend on the server. The service process is unreliable in the sense that it is possible for the customer at service completion to rejoin the queue and request for more service. The customer arrival process is assumed to satisfy a linear-quadratic model of uncertainty. We will present transient and steady-state analysis on the queueing model. The transient analysis provides a stability condition for the system to reach steady state. The steady-state analysis provides explicit expressions for several performance measures of the system. For the special case of MX/G/1 vacation queue with a gated or exhaustive service policy and Bernoulli feedback, our result reduces to a previously known result. Lastly, we show that a variant of our periodic staffing schedule model can be used to analyze queues with permanent customers. For the special case of M/G/1 queue with permanent customers and Bernoulli feedback of ordinary customers, we obtain results previously given by Boxma and Cohen (IEEE J. Select. Areas Commun. 9 (1991) 179) and van den Berg (Sojourn Times in Feedback and Processor Sharing Queues, CWI Tracts, vol. 97, Amsterdam, Netherlands, 1993).
Assessment of Today's Mobile Banking Applications from the View of Customer Requirements
Authors: Key Pousttchi, Martin Schurig
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Mobile banking is a subset of electronic banking which underlies not only the determinants of the banking business but also the special conditions of mobile commerce. This paper analyzes customer needs and expectations from the mobile applications' view and from the banking view in order to derive a defined set of requirements. Based on these results, existing mobile banking applications are assessed. Their major shortcomings are explained, opportunities for their improvement are shown and the impact of upcoming new technology is discussed. The outcome of the paper is a defined set of customer requirements to mobile banking applications, the identification and assessment of four standard types of current mobile banking applications and an explanation of major failure reasons along with opportunities for their improvement.
Timing-sync protocol for sensor networks
Authors: Saurabh Ganeriwal, Ram Kumar, Mani B. Srivastava
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

Wireless ad-hoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. This is realized by exchanging messages that are time-stamped using the local clocks on the nodes. Therefore, time synchronization becomes an indispensable piece of infrastructure in such systems. For years, protocols such as NTP have kept the clocks of networked systems in perfect synchrony. However, this new class of networks has a large density of nodes and very limited energy resource at every node; this leads to scalability requirements while limiting the resources that can be used to achieve them. A new approach to time synchronization is needed for sensor networks.In this paper, we present Timing-sync Protocol for Sensor Networks (TPSN) that aims at providing network-wide time synchronization in a sensor network. The algorithm works in two steps. In the first step, a hierarchical structure is established in the network and then a pair wise synchronization is performed along the edges of this structure to establish a global timescale throughout the network. Eventually all nodes in the network synchronize their clocks to a reference node. We implement our algorithm on Berkeley motes and show that it can synchronize a pair of neighboring motes to an average accuracy of less than 20ms. We argue that TPSN roughly gives a 2x better performance as compared to Reference Broadcast Synchronization (RBS) and verify this by implementing RBS on motes. We also show the performance of TPSN over small multihop networks of motes and use simulations to verify its accuracy over large-scale networks. We show that the synchronization accuracy does not degrade significantly with the increase in number of nodes being deployed, making TPSN completely scalable.
A note on Tutte polynomials and Orlik--Solomon algebras
Authors: Raul Cordovil, David Forge
Venue: European Journal of Combinatorics (2003)

Let A¢ = {H1,....,Hn} be a (central) arrangement of hyperplanes in ¢d and M(A¢) the dependence matroid of the linear forms {θHi ∈ (¢d)* : Ker(θHi) = Hi}. The Orlik-Solomon algebra OS(M) of a matroid M is the exterior algebra on the points modulo the ideal generated by circuit boundaries. The graded algebra OS(M(A¢)) is isomorphic to the cohomology algebra of the manifold m = ¢d\H ∈ A¢ H. The Tutte polynomial TM(x, y) is a powerful invariant of the matroid M. When M(A¢) is a rank 3 matroid and the θHi are complexifications of real linear forms, we will prove that OS(M) determines TM(x, y). This result partially solves a conjecture of Falk.
Metadata in Web Information Services and Systems
Authors: Eva M. Méndez Rodríguez
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

Metadata, specifically DCMI (Dublin Core Metadata Initiative) and its element set ISO 15836-2003, establishes one of the operational infrastructures of the Semantic Web and one of the interoperability main keys for electronic information management and retrieval. This metadata schemas, beside XML/RDF syntactic code, the content description schemes (ontologies, topic maps, thesaurus, etc.) and a set of protocols for information interchange, will be the protagonists of the Second Generation of the Web.This landscape will be reflected by this tutorial. Its specific aims are:To present an introduction to the metadata concept and application.To define the metadata role in Web systems and services, versus its role in global information retrieval by all the web search engines.To present the general principles for any metadata project, mainly metadata schemas assessment and selection.To reflect the metadata schemas, models and standards possibilities and their syntax andcoding (HTML/XML/RDF), and their heterogeneity problems and the need of planning interoperability between different web information objects.To explain paradigmatic cases of metadata management in subject gateways, theirparticularities and prospective use.
A new consistency algorithm for dynamic documents in content distribution networks
Authors: Zongming Fei
Venue: Journal of Parallel and Distributed Computing (2003)

One of the important problems in content distribution networks is how to maintain the consistency of content at replicas with the origin server, especially for those documents changing dynamically. In this paper, we propose a new hybrid consistency algorithm that will generate less traffic than the traditional propagation approach, and the invalidation approach. The basic scheme is extended to the case in which requests are not evenly distributed over all replicas. We propose a hierarchical framework which allows replicas at different levels to make a decision based on the statistics collected. Extensive simulations are performed to examine how the traffic generated and the freshness ratio at replicas are affected by various parameters. We experiment with a wide range of request rates, update frequencies, and numbers of replicas. The results show that our approach can take advantage of content distribution networks and significantly reduce the traffic generated.
Counting Complexity Classes for Numeric Computations I: Semilinear Sets
Authors: Peter Bürgisser, Felipe Cucker
Venue: SIAM Journal on Computing (2004)

We define a counting class ${\rm \#P}_\add$ in the Blum--Shub--Smale setting of additive computations over the reals. Structural properties of this class are studied, including a characterization in terms of the classical counting class $\#{\sf P}$ introduced by Valiant. We also establish transfer theorems for both directions between the real additive and the discrete setting. Then we characterize in terms of completeness results the complexity of computing basic topological invariants of semilinear sets given by additive circuits. It turns out that the computation of the Euler characteristic is ${\rm FP}_{\rm add}^{{\rm \#P}_{\rm add}}$-complete, while for fixed $k$ the computation of the $k$th Betti number is ${\rm FPAR}_{\rm add}$-complete. Thus the latter is more difficult under standard complexity theoretic assumptions. We use all of the above to prove some analogous completeness results in the classical setting.
Parallel algorithms for Bayesian phylogenetic inference
Authors: Xizhou Feng, Duncan A. Buell, John R. Rose, Peter J. Waddell
Venue: Journal of Parallel and Distributed Computing (2003)

The combination of a Markov chain Monte Carlo (MCMC) method with likelihood-based assessment of phylogenies is becoming a popular alternative to direct likelihood optimization. However, MCMC, like maximum likelihood, is a computationally expensive method. To approximate the posterior distribution of phylogenies, a Markov chain is constructed, using the Metropolis algorithm, such that the chain has the posterior distribution of the parameters of phylogenies as its stationary distribution.This paper describes parallel algorithms and their MPI-based parallel implementation for MCMC-based Bayesian phylogenetic inference. Bayesian phylogenetic inference is computationally expensive both in time and in memory requirements. Our variations on MCMC and their implementation were done to permit the study of large phylogenetic problems. In our approach, we can distribute either entire chains or parts of a chain to different processors, since in current models the columns of the data are independent. Evaluations on a 32-node Beowulf cluster suggest the problem scales well. A number of important points are identified, including a superlinear speedup due to more effective cache usage and the point at which additional processors slow down the process due to communication overhead.
Model of natural language communication system for virtual market of services
Authors: Piotr Pechmann, Jerzy Sołdek
Venue: Artificial intelligence and security in computing systems (2003)

Using a natural language in communication with a computer system can greatly facilitate the access to computer services for an average user. This paper presents a model of such communication system based on results of our own research of semantic analysis and sentence generation in Polish language that can be used in a human-computer dialogue.Described here are multi-agent system structures and specified agent functions related to communication based on natural language. Achievability of the proposed system of the virtual market of services and functions intended for agents are also discussed.The plans for the future work and research that aim at constructing a prototype of the system of the multi-agent virtual market of services with the capacity for natural language communication between client and service system are discussed in the conclusion.
Method for Insuring IT Risks
Authors: Christer Magnusson, Louise Yngström
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

This paper explains in detail the method behind the insurance database Estimated Maximum information technology Loss (EMitL). The database has been a crucial tool to make it possible to insure IT perils. It helps to insure IT-perils financially in the same professional way as consequences of traditional perils like fire, flood, and robbery are insured, and thereby secures shareholders' investments.EMitL estimates the security awareness in an existing IT-platform. Based on that information, existing security measures can be "priced" as they may reduce the estimated maximum loss figures - and thereby the costs for the insurance. In addition, a more cost-effective decision can be made on additional security measures. Furthermore, the costs for the loss exposure inherent in a business service/product can be estimated in a better way, and thereby be incorporated in the product's price. The IT insurances are based on the traditional industries' classes: Liability, Loss of Property, and Business Interruption. The insurance class Liability is divided into insurance policies for: Business Interruption, Fraud and Embezzlement, Robbery and Theft, Defamation, Infringement of Privacy, and Infringement of code, trademark etc. The insurance policies in the class Loss of Property are: Fraud and Embezzlement, and Robbery and Theft. The database EMitL layers insurance covers, which is a common method in the insurance industry. This means that the insurance policies are layered according to the amount of financial cover they provide. The insurance levels relate and are converted to security levels. These levels are built on the IT security properties Integrity, Availability and Confidentiality, and are utilized differently, depending on the insurance level and the type of insurance policy. The properties and the levels constitute the base of the Security Polices produced by EMitL; they are used for the estimation of securityawareness and as terms of insurance.