ppxscal/embedding_network huggingface dataset:
The Role of Digital Signature Cards in Electronic Voting
Authors: Robert Kofler, Robert Krimmer, Alexander Prosser, Martin-Karl Unger
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

As electronic voting enters the stage of real-world implementations, digital signature cards emerge as a basic infrastructure element for e-voting. The paper focuses on three main functions of such cards: (i) Authentication and (as National ID Card also) identification, (ii) as a storage media and (iii) as a secure processing environment. These properties enable protocols for secure e-voting, which guarantees the General Voting Principles.However, the diffusion of digital signature cards is still relatively low and in many cases, electronic vote casting has to be implemented without such cards. The paper reports on a test election conducted in Austria in May 2003 using a protocol designed for digital signature cards, which was adapted to a case, where such cards are not (yet) available. The necessaryadaptations clearly show the importance of digital signature cards for secure e-voting.
Multistage Production to Order with Rework Capability
Authors: Abraham Grosfeld-Nir, Yigal Gerchak
Venue: Management Science (2002)

This study considers multistage production systems where defective units can be reworked repeatedly at every stage. Production, as well as rework, is in lots requiring set-up and variable production costs, and orders need to be filled in their entirety. The yield of each stage is uncertain, so several production runs may need to be attempted until the quantity of finished products is sufficient. The trade-off at each stage is between using small lots, possibly necessitating repeated rework set-ups and large lots, which may result in costly overproduction. Multistage manufacturing facilities with rework capabilities are quite common in practice, but their optimal operation when orders have to be met in full has been virtually unexplored. We show that a multistage system where only one of the stages requires a setup (a "single-bottleneck system") can be reduced to a single-stage system. Moreover, if it is possible to arrange the operations in any order, we prove that it is best to make the "bottleneck" the first stage of the system. We also develop recursive algorithms for solving two- and three-stage systems, where all stages require set-ups, optimally. Generalizations to systems where rework yields and costs differ from those of initial processing are also discussed.
The museum visit: generating seamless personalized presentations on multiple devices
Authors: C. Rocchi, O. Stock, M. Zancanaro, M. Kruppa, A. Krüger
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

The issue of the seamless interleaving of interaction with a mobile device and stationary devices is addressed, in a typical situation of educational entertainment: the visit to a museum. Some of the salient elements of the described work are the emphasis on multimodality in the dynamic presentation and coherence throughout the visit.The adopted metaphor is of a kind of contextualized TV-like presentation, useful for engaging (young) visitors. On the mobile device, personal video clips are dynamically generated from personalized verbal presentations; on larger stationary screens distributed throughout the museum, further background material and additional information is provided. A virtual presenter follows the visitors in their experience and gives advice on both types of devices and on the museum itself.
On Formalization of the Whole-Part Relationship in the Unified Modeling Language
Authors: Hee Beng Kuan Tan, Lun Hao, Yong Yang
Venue: IEEE Transactions on Software Engineering (2003)

Aformal definition for the semantics of the Whole-Part relationship in the Unified Modeling Language (UML) is introduced. This paper reports some discrepancies and proposes solutions to these discrepancies.
A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks
Authors: Krzysztof M. Walkowiak
Venue: Computational Optimization and Applications (2004)

Issues of computer network survivability have gained much attention in recent years since computer networks plays an important role in modern world. Many organizations, institutions, companies use computer networks as a basic tool for transmitting many kinds of information. Service disruptions in modern networks are expected to be significant because loss of services and traffic in high-speed fiber systems could cause a lot of damages including economic loses, political conflicts, human health problems. In this paper we focus on problems of survivable connection oriented network design. A new objective function LF for primary routes assignment applying the local-destination rerouting strategy is defined. Next, an optimization problem of primary routes assignment using the LF function is formulated. Moreover, a branch and bound algorithm for that problem is proposed. The theory and experimental results demonstrate the ability to apply the LF function to dynamic and static design of survivable connection oriented networks.
Languages and semantics of grammatical discrete structures
Authors: Kristina Shea, Jonathan Cagan
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

Applying grammatical formalisms to engineering problems requires consideration of spatial, functional, and behavioral design attributes. This paper explores structural design languages and semantics for the generation of feasible and purposeful discrete structures. In an application of shape annealing, a combination of grammatical design generation and search, to the generation of discrete structures, rule syntax, and semantics are used to model desired relations between structural form and function as well as control design generation. Explicit domain knowledge is placed within the grammar through rule and syntax formulation, resulting in the generation of only forms that make functional sense and adhere to preferred visual styles. Design interpretation, or semantics, is then used to select forms that meet functional and visual goals. The distinction between syntax used in grammar rules to explicitly drive geometric design and semantics used in design interpretation to implicitly guide geometric form is shown. Overall, the designs presented show the validity of applying a grammatical formalism to an engineering design problem and illustrate a range of possibilities for modeling functional and visual design criteria.
Automatically detecting deceptive criminal identities
Authors: Gang Wang, Hsinchun Chen, Homa Atabakhsh
Venue: Communications of the ACM (2004)

The criminal mind is no match for some of the latest technology designed to determine fact from fiction in suspect identities.
Countering design exclusion through inclusive design
Authors: Simeon Keates, P. John Clarkson
Venue: Proceedings of the 2003 conference on Universal usability (2003)

The world population is aging and the number of people who are experiencing a loss of functional capability is also on the increase. There is a need to design 'inclusive' products to accommodate this wider range of capabilities and to develop metrics to assess the success of such products. Successful inclusive design requires a balance between the demands a product makes of its users and the users' capabilities, along with a number of design metrics and data to enable their evaluation. If the balance is not correct, then there is the potential for design exclusion.
Exms: an animated and avatar-based messaging system for expressive peer communication
Authors: Per Persson
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

While many synchronous computer-mediated communication systems have failed to encourage users to make use of the expressive capabilities of their avatars, asynchronous systems may hold better chance. This paper reports on the design and user study of a message system that allows users to concatenate and annotate avatar animations and send them to peers. During three weeks, a group of 11 17-year-olds exchanged 222 animated messages in their everyday life environment. The interplay between text and animation allowed users to create significantly expressive messages. Many messages told micro-stories about fictitious and real events. Users identified with their avatars and were proud of their embodied representation. The content of messages deepened during the course of the study.
Hierarchical layout verification for submicron designs
Authors: W. Meier
Venue: Proceedings of the conference on European design automation (1990)

In this paper we present the program HEXDRC for hierarchical circuit extraction and design rule check. The main problem for hierarchical layout verification is to handle interactions between different cells effectively. The kind of interactions however strongly depends on the actual design style, so that it will be impossible to find a solution which will work optimal for all layouts. To solve this problem, HEXDRC offers a lot of possibilities to modify the implemented basic algorithm by user instructions. HEXDRC includes design rule checking and netlist extraction, both working on the same database. This allows to verify more complex rules than with separate tools. We discuss the basic concept, describe how to adapt the program to a special design style and present first experimental results.
Constraint Satisfaction Problems on Intervals and Lengths
Authors: Andrei Krokhin, Peter Jeavons, Peter Jonsson
Venue: SIAM Journal on Discrete Mathematics (2004)

We study interval-valued constraint satisfaction problems (CSPs), in which the aim is to find an assignment of intervals to a given set of variables subject to constraints on the relative positions of intervals. Many well-known problems such as INTERVAL GRAPH RECOGNITION and INTERVAL SATISFIABILITY can be considered as examples of such CSPs. One interesting question concerning such problems is to determine exactly how the complexity of an interval-valued CSP depends on the set of constraints allowed in instances. For the framework known as Allen's interval algebra this question was completely answered earlier by the authors, by giving a complete description of the tractable cases and showing that all remaining cases are NP-complete.Here we extend the qualitative framework of Allen's algebra with additional constraints on the lengths of intervals. We allow these length constraints to be expressed as Horn disjunctive linear relations, a well-known tractable and sufficiently expressive form of constraints. The class of problems we consider contains, in particular, problems that are very closely related to the previously studied UNIT INTERVAL GRAPH SANDWICH problem. We completely characterize sets of qualitative relations for which the CSP augmented with arbitrary length constraints of the above form is tractable. We also show that, again, all the remaining cases are NP-complete.
The design of I-mass as a tool for interacting with cultural heritage
Authors: Geert de Haan
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

This paper gives an overview of the I-Mass system, an application to interact with digital cultural heritage information by way of metadata descriptions, irrespective of the specific storage and access characteristics such as format, location, and language. The paper describes the approach used to solve the so-called problem of "interoperability of content" - or the resolution of syntactic and semantic interoperability, respectively. It further describes the workings of I-Mass guided by the agent-based architecture and the requirements analysis and usability evaluation involved, and presents some first results.
Integrating expert knowledge into industrial control structures
Authors: Sylvie Galichet, Laurent Foulloy
Venue: Computers in Industry (2003)

This paper is concerned with the improvement of existing industrial control structures by the integration of human experience and exertise. Through two case studies concerning mechanical and petrochemical industries, it is illustrated that conventional control techniques and knowledge-based strategies can complement each other. The objective is to derive maximum profit from available materials and equipment by combining them efficiently. From a concrete point of view, linguistic fuzzy systems (LFS) are used to achieve a collaboration between numeric and expert processing.Three distinct architectures are proposed to combine conventional regulators and knowledge-based procedures in a unified control structure. All of them are based on a context-oriented decomposition of the control problem under consideration. The choice of a particular architecture is then related to existing industrial installations and is finally dependent on company strategy.
Poisson Approximation for the Non-Overlapping Appearances of Several Words in Markov Chains
Authors: Ourania Chryssaphinou, Stavros Papastavridis, Eutichia Vaggelatou
Venue: Combinatorics, Probability and Computing (2001)

Let X1, &hellip;, Xn be a sequence of r.v.s produced by a stationary Markov chain with state space an alphabet &Omega; = {&omega;1, &hellip;, &omega;q}, q &ge; 2. We consider a set of words {A1, &hellip;, Ar}, r &ge; 2, with letters from the alphabet &Omega;. We allow the words to have self-overlaps as well as overlaps between them. Let &Escr; denote the event of the appearance of a word from the set {A1, &hellip;, Ar} at a given position. Moreover, define by N the number of non-overlapping (competing renewal) appearances of &Escr; in the sequence X1, &hellip;, Xn. We derive a bound on the total variation distance between the distribution of N and a Poisson distribution with parameter &Eopf;N. The Stein&ndash;Chen method and combinatorial arguments concerning the structure of words are employed. As a corollary, we obtain an analogous result for the i.i.d. case. Furthermore, we prove that, under quite general conditions, the r.v. N converges in distribution to a Poisson r.v. A numerical example is presented to illustrate the performance of the bound in the Markov case.
Secure sharing of location information over Ad hoc networks: an application of secure multicast
Authors: Guevara Noubir, Guolong Lin, Mikhail Golitsine, Nick Plante
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

In this paper we address the problem of secure multicast of data streams over a multihop wireless ad hoc network. We propose a key management protocol that aims at solving problems that are specific to ad hoc networks such as mobility, unreliable links, and multihop communication cost. The main idea is to have group members actively participate to the multicast group security therefore reducing the communication and computation load on the source. We also extend the proposed basic secure multicast tree using multi-link capability combined with a k-out-of-N coding approac. Since the group security is distributed among the group members we propose a service right certificate to verify that a node is authorized to join the group and also corresponding revocation mechanism. We simulated our protocol within the ns-2 environment under various mobility, group size, and group dynamic scenarios. Our preliminary simulation results indicate that the communication cost and join delay of the protocol scale well when the group size and nodes mobility increase.
Sequentiality vs. concurrency in games and logic
Authors: Samson Abramsky
Venue: Mathematical Structures in Computer Science (2003)

Connections between the sequentiality&sol;concurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic.
A CC-based Security Engineering Process Evaluation Model
Authors: Jongsook Lee, Jieun Lee, Seunghee Lee, Byoungju Choi
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Common Criteria(CC) provides only the standard forevaluating information security product or system, namelyTarget of Evaluation (TOE). On the other hand, SSE-CMMprovides the standard for Security Engineering ProcessEvaluation. Based on the CC, TOE's security quality maybe assured, but its disadvantage is that the developmentprocess is neglected. SSE-CMM seems to assure thequality of TOE developed in an organization equipped withsecurity engineering process, but the TOE developed insuch environment cannot avoid CC-based securityassurance evaluation.We propose an effective method of integrating twoevaluation methods, CC and SSE-CMM, and develop CC-based assurance evaluation model, CC_SSE-CMM.CC_SSE-CMM presents the specific and realisticallyoperable organizational security process maturityassessment and CC evaluation model.
On the q-analogues of the Zassenhaus formula for disentangling exponential operators
Authors: R. Sridhar, R. Jagannathan
Venue: Journal of Computational and Applied Mathematics (2003)

Katriel, Rasetti and Solomon introduced a q-analogue of the Zassenhaus formula written as eq(A+B)= eqAeqBeqc2eqc3eqc4eqc5..., where A and B are two generally noncommuting operators and eqz is the Jackson q- exponential, and derived the expressions for c2, c3 and c4. It is shown that one can also write eq(A+B)= eqAeqBeq2C2eq3C3eq4C4eq5C5...Explicit expressions for C2, C3 and C4 are given.
Weak Converse Lyapunov Theorems and Control-Lyapunov Functions
Authors: Christopher M. Kellett, Andrew R. Teel
Venue: SIAM Journal on Control and Optimization (2003)

Given a weakly uniformly globally asymptotically stable closed (not necessarily compact) set ${\cal A}$ for a differential inclusion that is defined on $\mathbb{R}^n$, is locally Lipschitz on $\mathbb{R}^n \backslash {\cal A}$, and satisfies other basic conditions, we construct a weak Lyapunov function that is locally Lipschitz on $\mathbb{R}^n$. Using this result, we show that uniform global asymptotic controllability to a closed (not necessarily compact) set for a locally Lipschitz nonlinear control system implies the existence of a locally Lipschitz control-Lyapunov function, and from this control-Lyapunov function we construct a feedback that is robust to measurement noise.
Self-Tuning of the Relationships among Rules' Components in Active Databases Systems
Authors: David Botzer, Opher Etzion
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--Active databases systems are systems that detect events and trigger actions as a result of this detection. Active capabilities are provided by a set of rules, such that each rule consists of three components (event, condition, and action). A major performance issue in active databases is the issue of relationships among rule components. Current implementations of triggers do not allow flexibility in the selection of transaction policies (partition of rules to transactions); the intertransaction timing policies of rules' components, the intratransaction policies of commit and abort dependencies, and synchronization issues. While these decisions have a substantial impact on the application performance, they are not provided as design primitives; one of the reasons for that is that it is very difficult to manually tune these decisions. In some research prototypes of active databases, these relationships are encapsulated into a set of coupling modes. Each coupling mode represents a combination of decisions about the partition of rule components to transactions, the relative timing within a transaction, and the interrelationships among these transactions. This paper describes a self-tuning model that operates on a general active database. The optimization model strives to minimize a programmable goal function that reflects the system designer's preferences and the system behavior and the applications' semantics through constraint definitions. The tuning model strives to optimize the mutual relationships among the system rules' components.
The maximum edge biclique problem is NP-complete
Authors: René Peeters
Venue: Discrete Applied Mathematics (2003)

We prove that the maximum edge biclique problem in bipartite graphs is NP-complete.
XmdvTool: integrating multiple methods for visualizing multivariate data
Authors: Matthew O. Ward
Venue: Proceedings of the conference on Visualization '94 (1994)

Much of the attention in visualization research has focussed on data rooted in physical phenomena, which is generally limited to three or four dimensions. However, many sources of data do not share this dimensional restriction. A critical problem in the analysis of such data is providing researchers with tools to gain insights into characteristics of the data, such as anomalies and patterns. Several visualization methods have been developed to address this problem, and each has its strengths and weaknesses. This paper describes a system named XmdvTool which integrates several of the most common methods for projecting multivariate data onto a two-dimensional screen. This integration allows users to explore their data in a variety of formats with ease. A view enhancement mechanism called an N-dimensional brush is also described. The brush allows users to gain insights into spatial relationships over N dimensions by highlighting data which falls within a user-specified subspace.
Databases Deepen the Web
Authors: Thanaa M. Ghanem, Walid G. Aref
Venue: Computer (2004)

Online databases continually generate Web content that users can only access through direct database queries.
Wavelet methods for continuous-time prediction using Hilbert-valued autoregressive processes
Authors: Anestis Antoniadis, Theofanis Sapatinas
Venue: Journal of Multivariate Analysis (2003)

We consider the prediction problem of a continuous-time stochastic process on an entire time-interval in terms of its recent past. The approach we adopt is based on the notion of autoregressive Hilbert processes that represent a generalization of the classical autoregressive processes to random variables with values in a Hilbert space. A careful analysis reveals, in particular, that this approach is related to the theory of function estimation in linear ill-posed inverse problems. In the deterministic literature, such problems are usually solved by suitable regularization techniques. We describe some recent approaches from the deterministic literature that can be adapted to obtain fast and feasible predictions. For large sample sizes, however, these approaches are not computationally efficient.With this in mind, we propose three linear wavelet methods to efficiently address the aforementioned prediction problem. We present regularization techniques for the sample paths of the stochastic process and obtain consistency results of the resulting prediction estimators. We illustrate the performance of the proposed methods in finite sample situations by means of a real-life data example which concerns with the prediction of the entire annual cycle of climatological El Niño-Southern Oscillation time series 1 year ahead. We also compare the resulting predictions with those obtained by other methods available in the literature, in particular with a smoothing spline interpolation method and with a SARIMA model.