ppxscal/embedding_network huggingface dataset:
Digital 101: Public Exhibition System of the National Digital Archives Program, Taiwan
Authors: Ku-Lun Huang, Hsiang-An Wang
Venue: Proceedings of the 11th European conference on Research and Advanced Technology for Digital Libraries (2007)

Since the establishment of the National Digital Archives Program (NDAP), Taiwan in 2002, the five divisions and their accompanying projects have generated a huge amount of digital materials. The diverse content is available for multiple purposes, such as research, value-added applications and educational projects. The goal is allow the public to explore the achievements of NDAP in user-friendly ways. Digital 101, which is also called the Public Exhibit System (PES), serves to connect various groups interested in Taiwan's rich cultural heritage.PES incorporates artistic, creative interactive user interfaces and popular methods that allow the public to utilize the content of the NDAP. Through collaboration with local artists, PES provides special exhibits and thematic image galleries about Taiwan's rich culture. It is expected to become a gateway worldwide.
Enabling Reputation-Based Trust in Privacy-Enhanced Learning Systems
Authors: Mohd Anwar, Jim Greer
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Privacy and trust are the cornerstones of safe and engaging learning environments. Trust is associated with the reputation of an actor. Pseudonymous identities can accrue trust while preserving the actor's privacy. But activities such as aggregating reputations from an actor's multiple pseudo-identities or transferring reputation to a new pseudonym pose problems with privacy preservation. In this vein, we propose privacy-preserving identity management systems for learners that support reputation aggregation and transfer across multiple pseudonyms.
The Rise of the Gadgets
Authors: Ivan Arce
Venue: IEEE Security and Privacy (2003)

So you think that to protect your IT infrastructure effectively you merely need to deploy a streamlined assess, patch, and audit process for your routers, servers, and workstations? Think again! Although it is indisputable that we must constantly monitor and patch networking hardware, servers, and workstations against the latest and most threatening bugs, a slowly growing trend might prove that strategy to be flawed, or at least not comprehensive.
Derivative Information from Fuzzy Models
Authors: Paulo Salgado, Fernando Gouveia
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

Universal approximation is the basis of theoretical research and practical application of fuzzy systems. The ability of fuzzy models to model static information has been successfully proven and tested, while on the other hand their limitations in simultaneously modelling dynamical information are well known. Generally, the fuzzy model is a correct zero-order representation of a process or function. However the derivative of its mathematical expression is not necessarily a derivative fuzzy model of the process or function. A perturbed fuzzy system, as a generalization of the traditional fuzzy system, is proposed. It has the ability to uniformly approximate continuous functions and their derivatives on arbitrarily compact sets to the desired degree.
Automatic Classification of Abandoned Objects for Surveillance of Public Premises
Authors: Ahmed Fawzi Otoom, Hatice Gunes, Massimo Piccardi
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

One of the core components of any visual surveillance system is object classification, where detected objects are classified into different categories of interest. Although in airports or train stations, abandoned objects are mainly luggage or trolleys, none of the existing works in the literature have attempted to classify or recognize trolleys. In this paper, we analyzed and classified images of trolley(s), bag(s), single person(s), and group(s) of people by using various shape features with a number of uncluttered and cluttered images and applied multi-frame integration to overcome partial occlusions and obtain better recognition results. We also tested the proposed techniques on data extracted from a well-recognized and recent data set, PETS 2007 benchmark data set [16]. Our experimental results show that the features extracted are invariant to data set and classification scheme chosen. For our four-class object recognition problem, we achieved an average recognition accuracy of 70%.
Mobility and social interaction as core gameplay elements in multi-player augmented reality
Authors: Alessandro Mulloni, Daniel Wagner, Dieter Schmalstieg
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

In this paper, we present an Augmented Reality game that strongly exploits mobility and social interaction between players as core gameplay elements. We have implemented this game on handheld devices and conducted a qualitative user study, investigating the level of mobility and social involvement of players. We discuss the results from this user study, describing the problems experienced by players and how we tackled them.
Optimization of Mobile IPv6 Handover Performance Using E-HCF Method
Authors: Guozhi. Wei, Anne. Wei, Ke. Xu, Gerard. Dupeyrat
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Mobile IPv6 permits the Mobile Node (MN) to maintain the continuous connectivity to the Internet when it moves from one access router to another. Due to both link switching delay and IPv6 protocol operation during the handover process, packets destined to the MN can be delayed or lost. This paper proposes a solution to improve the Mobile IPv6 handover performance over wireless network by introducing a new entity - Extension Handover Control Function (E-HCF). E-HCF could send the decisive control message to MN to accelerate the handover process and manage the traffic belonging to MN to reduce the packet loss. With a comparison between Mobile IPv6 and our E-HCF solution, we show that our solution allows us providing low-latency and low packet loss for real-time services during the handover.
The New Promise of Analog Computation
Authors: José Félix Costa, Bruno Loff, Jerzy Mycka
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We show that, using our more or less established framework of inductive definition of real-valued functions (work started by Cristopher Moore in [9]) together with ideas and concepts of standard computability we can prove theorems of Analysis. Then we will consider our ideas as a bridging tool between the standard Theory of Computability (and Complexity) on one side and Mathematical Analysis on the other, making real recursive functions a possible branch of Descriptive Set Theory. What follows is an Extended Abstract directed to a large audience of CiE 2007, Special Session on Logic and New Paradigms of Computability. (Proofs of statements can be found in a detailed long paper at the address http://fgc.math.ist.utl.pt/papers/hierarchy.pdf.)
Use Cases for Refactoring in Erlang
Authors: Tamás Kozsik, Zoltán Csörnyei, Zoltán Horváth, Roland Király, Róbert Kitlei, László Lövei, Tamás Nagy, Melinda Tóth, Anikó Víg
Venue: Central European Functional Programming School: Second Summer School, CEFP 2007, Cluj-Napoca, Romania, June 23-30, 2007, Revised Selected Lectures (2008)

Tool support for refactoring provides guarantees for the preservation of the program semantics during program transformation. This paper explains how RefactorErl, a refactoring tool for the Erlang language helps the programmer raise the quality of Erlang code or make the code suitable for further changes and improvements. Many examples illustrate the seven transformations currently implemented in RefactorErl. The paper also discusses the problems the refactor tool has to face.
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
Authors: Pablo Arrighi, Vincent Nesme, Reinhard Werner
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

One-dimensional quantum cellular automata (QCA) consist in a line of identical, finite dimensional quantum systems. These evolve in discrete time steps according to a causal, shift-invariant unitary evolution. By causal we mean that no instantaneous long-range communication can occur. In order to define these over a Hilbert space we must restrict to a base of finite, yet unbounded configurations. We show that QCA always admit a two-layered block representation, and hence the inverse QCA is again a QCA. This is a striking result since the property does not hold for classical one-dimensional cellular automata as defined over such finite configurations. As an example we discuss a bijective cellular automata which becomes non-causal as a QCA, in a rare case of reversible computation which does not admit a straightforward quantization. We argue that a whole class of bijective cellular automata should no longer be considered to be reversible in a physical sense. Note that the same two-layered block representation result applies also over infinite configurations, as was previously shown for one-dimensional systems in the more elaborate formalism of operators algebras [13]. Here the proof is simpler and self-contained, moreover we discuss a counterexample QCA in higher dimensions.
Life beyond the public sphere: Towards a networked model for political deliberation
Authors: Axel Bruns
Venue: Information Polity (2008)

As the odds for a change of government in the Australian elections in late 2007 improve, there is increased conflict not only between the two sides of federal politics, but also between the mainstream press (which in recent years had maintained a largely supportive stance towards the government) and citizen journalists and news bloggers (many of whom have long held sharply critical views). The increasingly visible disconnect between the electorate and many political journalists points to wider observations about the decline of the mass-mediated public sphere, and the emergence of a variety of networked issue publics, possibly acting as public spherules in their own right and interacting with one another in complex patterns of exchange. This article explores the implications of this transformation for citizen engagement in politics and policy development, and applies observations from the analysis of produsage, or user-led content creation, to the democratic process.
Agile Requirements: Opportunity or Oxymoron?
Authors: Ken Orr
Venue: IEEE Software (2004)

Although some agile development advocates suggest that requirements aren't really necessary in an agile environment, the department this issue discusses how every system of consequence needs good requirements. Additionally, it attempts to clarify what "doing requirements" really means.
Engaging students in programming fundamentals using alice 2.0
Authors: Paul M. Mullins, Michael Conlon
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

Many of the programming principles taught in any programming fundamentals course are essentially the same. We will describe some of the principles and techniques that students learn in a first programming course using Alice 2.0 that is shared by programs in IS, IT, CS and liberal studies, drawing from the IT Computing Curricula 2005. We will then describe a set of nifty assignments that result in projects that exercise these principles and techniques and may be used to emphasize one or more in depth topical issues.
Some Observations on Two-Way Finite Automata with Quantum and Classical States
Authors: Daowen Qiu
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Two-way finite automata with quantum and classical states (2qcfa's) were introduced by Ambainis and Watrous. Though this computing model is more restricted than the usual two-way quantum finite automata (2qfa's) first proposed by Kondacs and Watrous, it is still more powerful than the classical counterpart. In this note, we focus on dealing with the operation properties of 2qcfa's. We prove that the Boolean operations (intersection, union, and complement) and the reversal operation of the class of languages recognized by 2qcfa's with error probabilities are closed; also, we verify that the catenation operation of such class of languages is closed under certain restricted condition. The numbers of states of these 2qcfa's for the above operations are presented. Some examples are included, and $\{xx^{R}|x\in \{a,b\}^{*},\#_{x}(a)=\#_{x}(b)\}$ is shown to be recognized by 2qcfa with one-sided error probability, where x R is the reversal of x, and # x (a) denotes the a's number in string x.
SPAM: Set Preference Algorithm for Multiobjective Optimization
Authors: Eckart Zitzler, Lothar Thiele, Johannes Bader
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

This paper pursues the idea of a general multiobjective optimizer that can be flexibly adapted to arbitrary user preferences--assuming that the goal is to approximate the Pareto-optimal set. It proposes the Set Preference Algorithm for Multiobjective Optimization (SPAM) the working principle of which is based on two observations: (i) current multiobjective evolutionary algorithms (MOEAs) can be regarded as hill climbers on set problems and (ii) specific user preferences are often (implicitly) expressed in terms of a binary relation on Pareto set approximations. SPAM realizes a (1 + 1)-strategy on the space of Pareto set approximations and can be used with any type of set preference relations, i.e., binary relations that define a total preorder on Pareto set approximations. The experimental results demonstrate for a range of set preference relations that SPAM provides full flexibility with respect to user preferences and is effective in optimizing according to the specified preferences. It thereby offers a new perspective on preference-guided multiobjective search.
Efficient Secret Authenticatable Anonymous Signcryption Scheme with Identity Privacy
Authors: Mingwu Zhang, Bo Yang, Shenglin Zhu, Wenzheng Zhang
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

Three of the most important services offered by cryptography are confidential, private and authenticatability in distributed systems, such as P2P, trust negotiation and decentralized trust management. Information provider secretly encrypts a message with a hidden approach to protect message security and his privacy. Ring signcryption is an important way to realize full anonymity where the signcrypter cannot verify that this ciphertext was produced by himself. In this paper, we propose a novel construction of efficient secret authenticatable anonymous signcryption scheme in which only the actual signcrypter can authenticate that the ciphertext was produced by himself. The receiver cannot distinguish who the actual signcrypter is in the group even though he obtains all group members' private keys. Proposed scheme has the following properties: semantic security, signcrypter anonymity, signcrypter secret authenticatability, and unforgeability. We prove its security in the random oracle model under the DBDH assumption.
A data gathering algorithm for a mobile sink in largescale sensor networks
Authors: E. M. Saad, M H. Awadalla, M. A. Saleh, H. Keshk, R. R. Darwish
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

Sink mobility is one of the most comprehensive trends for information gathering in sensor networks. This way of information gathering has a prominent role in balancing the energy consumption among sensor networks, and culling the hotspots problem of sensor networks. In this paper, a well planned adaptive moving strategy for a mobile sink in large-scale, hierarchical sensor networks is presented. The mobile sink traverses the entire network uploading the sensed data from cluster heads in time driven scenarios. The mobile sink trajectory is planned such that all heads require no multi-hop relays to reach the mobile sink. The proposed system aims at extending the lifetime of the sensor network by achieving a high level of energy efficiency and fair balancing of energy consumption across all network heads. Furthermore, reducing the loss that data incur due to buffer overflow. Extensive simulations are conducted in order to validate the proposed strategy. The adopted data gathering scheme outperforms the static sink scheme and periphery scheme in terms of life time elongation, and scalability.
Prediction of the Collapse Index by a Mamdani Fuzzy Inference System
Authors: Kivanc Zorlu, Candan Gokceoglu
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

Determination of collapse potential of collapsible grounds is an important problem for civil engineers. However, this requires extensive field and laboratory works. For this reason, prediction tools for this purpose are highly attractive for engineers. Considering this difficulty, development of a Mamdani fuzzy inference system for prediction of collapse index is the main purpose of the study. The fuzzy inference system developed in the study includes two inputs, one output and 25 lingusitic if-then rules. The performace of the fuzzy inference system is checked by various indices and these indices reveal that the fuzzy inference system has a significant prediction performance.
Symmetry-preserving upwind discretization of convection on non-uniform grids
Authors: Arthur E. P. Veldman, Ka-Wing Lam
Venue: Applied Numerical Mathematics (2008)

Although upwind discretization of convection will lead to a diagonally dominant coefficient matrix, on arbitrary grids the latter is not necessarily positive real, i.e. its symmetric part need not be positive definite ('negative diffusion'). Especially on contracting-expanding grids this property can be lost. The paper discusses a conservative (finite-volume) upwind variant for which the latter property is guaranteed to hold, irrespective of grid (ir)regularity. Further, empirically it is found that often its global discretization error is smaller than that of the 'traditional' (finite-difference) upwind method. Finally, it is shown that in many situations its extremal eigenvalues at the outer side of the spectrum move towards the imaginary axis, thus enhancing the stability of explicit time-integration methods.
Self-describing and Data Propagation Model for Data Distribution Service
Authors: Chungwoo Lee, Jaeil Hwang, Joonwoo Lee, Chulbum Ahn, Bowon Suh, Dong-Hoon Shin, Yunmook Nah, Doo-Hyun Kim
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

To realize real-time information sharing in generic platforms, it is especially important to support dynamic message structure changes. For the case of IDL, it is necessary to rewrite applications to change data sample structures. In this paper, we propose a dynamic reconfiguration scheme of data sample structures for DDS. Instead of using IDL, which is the static data sample structure model of DDS, we use a self describing model using data sample schema, as a dynamic data sample structure model to support dynamic reconfiguration of data sample structures. We also propose a data propagation model to provide data persistency in distributed environments. We guarantee persistency by transferring data samples through relay nodes to the receiving nodes, which have not participated in the data distribution network at the data sample distribution time. The proposed schemes can be utilized to support data sample structure changes during operation time and to provide data persistency in various environments, such as real-time enterprise environments and connection-less internet environments.
Phrase-Based Statistical Machine Translation Using Approximate Matching
Authors: Jesús Tomás, Jaime Lloret, Francisco Casacuberta
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

Phrase-based statistical models constitute one of the most competitive pattern-recognition approaches to machine translation. In this case, the source sentence is fragmented into phrases, then, each phrase is translated by using a stochastic dictionary. One shortcoming of this phrase-based model is that it does not have an adequate generalization capability. If a sequence of words has not been seen in training, it cannot be translated as a whole phrase. In this paper we try to overcome this drawback. The basic idea is that if a source phrase is not in our dictionary (has not been seen in training), we look for the most similar in our dictionary and try to adapt its translation to the source phrase. We are using the well known edit distance as a measure of similarity. We present results from an English-Spanish task (XRCE).
Spotting Symbols in Line Drawing Images Using Graph Representations
Authors: Rashid Jalal Qureshi, Jean-Yves Ramel, Didier Barret, Hubert Cardot
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

Many methods of graphics recognition have been developed throughout the years for the recognition of pre-segmented graphics symbols but very few techniques achieved the objective of symbol spotting and recognition together in a generic case. To go one step forward through this objective, this paper presents an original solution for symbol spotting using a graph represen-tation of graphical documents. The proposed strategy has two main step. In the first step, a graph based representation of a document image is generated that includes selection of description primitives (nodes of the graph) and organisation of these features (edges). In the second step the graph is used to spot interesting parts of the image that potentially correspond to symbols. The sub-graphs associated to selected zones are then submitted to a graph matching algorithm in order to take the final decision and to recognize the class of the symbol. The experimental results obtained on different types of documents demonstrates that the system can handle different types of images without any modification.
Urban sensing systems: opportunistic or participatory?
Authors: Nicholas D. Lane, Shane B. Eisenman, Mirco Musolesi, Emiliano Miluzzo, Andrew T. Campbell
Venue: Proceedings of the 9th workshop on Mobile computing systems and applications (2008)

The development of sensing systems for urban deployments is still in its infancy. An interesting unresolved issue is the precise role assumed by people within such systems. This issue has significant implications as to where the complexity and the main challenges in building urban sensing systems will reside. This issue will also impact the scale and diversity of applications that are able to be supported. We contrast two end-points of the spectrum of conscious human involvement, namely participatory sensing, and opportunistic sensing. We develop an evaluation model and argue that opportunistic sensing more easily supports larger scale applications and broader diversity within such applications. In this paper, we provide preliminary analysis which supports this conjecture, and outline techniques we are developing in support of opportunistic sensing systems.