ppxscal/embedding_network huggingface dataset:
May Day masks augmented on mobile phones
Authors: Charles Woodward, Petri Honkamaa, Timo Kinnunen, Markus Tallgren, Teppo Veijonen
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

In this paper we describe a fun application of augmenting masks on people's faces using mobile camera phones. The application was published on May Day 2008 in Finland, gaining thousands of visitors and downloads within a couple of days. We provide a description of the user interface and implementation issues, as well as analysis of user statistics and their comments.
Teaching for Conceptual Change in Security Awareness: A Case Study in Higher Education
Authors: Yuen-Yan Chan, Victor K. Wei
Venue: IEEE Security and Privacy (2009)

The authors present a case study in which conceptual change pedagogy was implemented in information security education. The results suggest conceptual change fostered by anomalous data is effective in the teaching and learning of information security.
Practical and effective IR-style keyword search over semantic web
Authors: Xiaomin Ning, Hai Jin, Weijia Jia, Pingpeng Yuan
Venue: Information Processing and Management: an International Journal (2009)

This paper presents a novel IR-style keyword search model for semantic web data retrieval, distinguished from current retrieval methods. In this model, an answer to a keyword query is a connected subgraph that contains all the query keywords. In addition, the answer is minimal because any proper subgraph can not be an answer to the query. We provide an approximation algorithm to retrieve these answers efficiently. A special ranking strategy is also proposed so that answers can be appropriately ordered. The experimental results over real datasets show that our model outperforms existing possible solutions with respect to effectiveness and efficiency.
Current topics in the discussion on the relationship between e-governance and education
Authors: Toshio Obi
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Electronic Governance, as defined by UNESCO is "the public sector's use of information and communication technologies with the aim of improving information and service delivery, encouraging citizen participation in the decision-making process and making government more accountable, transparent and effective". It can also be described as the process of forming relationship among stakeholders in order to achieve the common consensus. This tutorial will focus on what we consider are the main discussion topics on the relationship between Electronic Governance and Education, namely e-capacity building, and e-literacy, in the context of the existing digital divide and the goal of an inclusive society. For the purpose of this tutorial, we will analyze the interrelation between Electronic Governance and Education considering that the usage of ICTs for Education can lead to increased citizen engagement and participation, strengthening Electronic Governance.
Abstractions, composition and reasoning
Authors: Ella E. Roubtsova, Ashley T. McNeile
Venue: Proceedings of the 13th workshop on Aspect-oriented modeling (2009)

We propose that different process algebraic composition techniques, combined with consideration of the restrictions on the ability of different parts of a system to share data and state, can provide a basis for identifying abstractions at the Platform Independent level of modelling. The paper presents our ideas and is aimed to initiate a discussion about the basis for identification of abstractions and the related areas of composition, reasoning and interface specifications, at the platform independent level.
Group multi-attribute decision model to partner selection in the formation of virtual enterprise under incomplete information
Authors: Fei Ye, Yi-Na Li
Venue: Expert Systems with Applications: An International Journal (2009)

Partner selection is very important in the formation of a virtual enterprise. However, in many practical situations, during the partner selection process, the decision makers are generally unsure of their preferences because the information about the candidates and their performances are incomplete and uncertain. Therefore, two MADM (multi-attribute decision model) methods for group decision making with interval values are proposed to solve partner selection problem under incomplete information in this paper. The first method is a technique for order preference by similarity to ideal solution (TOPSIS) for group decision making based on deviation degree. The second method is a TOPSIS for group decision making based on risk factor. Finally, an illustrative example is used to demonstrate the feasibility and practicability of these two extended TOPSIS methods for group decision making with interval values. Results show that these two extended TOPSIS methods for group decision making with interval values can effectively deal with the partner selection problem under incomplete information.
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
Authors: Suzana Andova, Sonja Georgievska
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

A branching bisimulation for probabilistic systems that is preserved under parallel composition has been defined recently for the alternating model. We show that besides being compositional, it is decidable in polynomial time and it preserves the properties expressible in probabilistic Computation Tree Logic (pCTL). In the ground-complete axiomatization, only a single axiom is added to the axioms for strong bisimulation. We show that the Concurrent Alternating Bit protocol can be verified using the process algebra and a set of recursive rules.
A history of computing course with a technical focus
Authors: Geoffrey M. Draper, Robert R. Kessler, Richard F. Riesenfeld
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

Many courses on the history of computing are designed for a general student audience, and as such, include fewer technical details than one might find in a typical CS course. While this approach is appropriate in some contexts, it risks losing the interest of the students who could perhaps benefit most from the subject-namely, future computer scientists. This paper describes a technically-oriented History of Computing course which we taught at the University of Utah in 2008. Like other History of Computing courses, ours included a significant amount of writing and discussion. However, inasmuch as our course was created specifically for CS students, we also incorporated several "hands-on" programming exercises and demonstrations, giving students actual experience with the computing environments of the past. Students and faculty alike have responded enthusiastically to this dual-faceted approach.
A Soft Approach to Multi-objective Optimization
Authors: Stefano Bistarelli, Fabio Gadducci, Javier Larrosa, Emma Rollon
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Many combinatorial optimization problems require the assignment of a set of variables in such a way that an objective function is optimized. Often, the objective function involves different criteria, and it may happen that the requirements are in conflict: assignments that are good wrt. one objective may behave badly wrt. another. An optimal solution wrt. all criteria may not exist, and either the efficient frontier (the set of best incomparable solutions, all equally relevant in the absence of further information) or an approximation has to be looked after. The paper shows how the soft constraints formalism based on semirings, so far exploited for finding approximations, can embed also the computation of the efficient frontier in multi-objective optimization problems. The main result is the proof that the efficient frontier of a multi-objective problem can be obtained as the best level of consistency distilled from a suitable soft constraint problem.
Partial-modular DEVS for improving performance of cellular space wildfire spread simulation
Authors: Yi Sun, Xiaolin Hu
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Simulation of wildfire spread remains to be a challenging task. In previous work, a cellular space fire spread simulation model has been developed based on the Discrete Event System Specification (DEVS) formalism. There is a need to improve simulation performance of this model for simulating large scale wildfires. This paper develops a partial-modular implementation of the DEVS-based cellular space model that eliminates the large number of inter-cell message exchanges for improving simulation performance. Both the modular and partial-modular approaches are presented and experiment results are provided. The results show that the partial-modular implementation can significantly improve simulation performance of the cellular space wildfire spread model.
A Parallel Approach to XML Parsing
Authors: Wei Lu, Kenneth Chiu, Yinfei Pan
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

A language for semi-structured documents, XML has emerged as the core of the web services architecture, and is playing crucial roles in messaging systems, databases, and document processing. However, the processing of XML documents has a reputation for poor performance, and a number of optimizations have been developed to address this performance problem from different perspectives, none of which have been entirely satisfactory. In this paper, we present a seemingly quixotic, but novel approach: parallel XML parsing. Parallel XML parsing leverages the growing prevalence of multicore architectures in all sectors of the computer market, and yields significant performance improvements. This paper presents our design and implementation of parallel XML parsing. Our design consists of an initial preparsing phase to determine the structure of the XML document, followed by a full, parallel parse. The results of the preparsing phase are used to help partition the XML document for data parallel processing. Our parallel parsing phase is a modification of the libxml2 [1] XML parser, which shows that our approach applies to real-world, production quality parsers. Our empirical study shows our parallel XML parsing algorithm can improved the XML parsing performance significantly and scales well.
Packet communication of online speech
Authors: Danny Cohen
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

The rapid progress of both communication and processing technologies in recent years constitutes a challenging technological revolution, epitomized by the photographs sent by Voyager from Saturn. This revolution offers new opportunities for many avenues of technology. Real-time speech communication is one of them. This paper discusses the use of packet switching, the emerging computer communication technology, for online speech application. The paper reviews the computer communication technologies such as packet and circuit switching, datagrams, and virtual circuits. It mentions the voice encoding (vocoding) algorithms and their implementation and discusses the interaction of vocoding and packet-switching technology. It argues about the issues of network voice protocols and introduces applications of online speech. After describing the experience with packet speech, the paper concludes with several ideas about the future of the field.
Multigrid on GPU: tackling power grid analysis on parallel SIMT platforms
Authors: Zhuo Feng, Peng Li
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The challenging task of analyzing on-chip power (ground) distribution networks with multi-million node complexity and beyond is key to today's large chip designs. For the first time, we show how to exploit recent massively parallel single-instruction multiple-thread (SIMT) based graphics processing unit (GPU) platforms to tackle power grid analysis with promising performance. Several key enablers including GPU-specific algorithm design, circuit topology transformation, workload partitioning, performance tuning are embodied in our GPU-accelerated hybrid multigrid algorithm, GpuHMD, and its implementation. In particular, a proper interplay between algorithm design and SIMT architecture consideration is shown to be essential to achieve good runtime performance. Different from the standard CPU based CAD development, care must be taken to balance between computing and memory access, reduce random memory access patterns and simplify flow control to achieve efficiency on the GPU platform. Extensive experiments on industrial and synthetic benchmarks have shown that the proposed GpuHMD engine can achieve 100X runtime speedup over a state-of-the-art direct solver and be more than 15X faster than the CPU based multigrid implementation. The DC analysis of a 1.6 million-node industrial power grid benchmark can be accurately solved in three seconds with less than 50MB memory on a commodity GPU. It is observed that the proposed approach scales favorably with the circuit complexity, at a rate about one second per million nodes.
Inverse Analysis of Rock Displacement Based on Improved MSM-PGA
Authors: Guiquan Bi, Ning Li, Xingyan Cheng, Tinghong Zhao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Inverse analysis of rock displacement is a kind of new way of studying the parameter of physical power of rock, a lot of researchers have carried on research in this respect, and some researchers among them ask solving this question with the genetic algorithm. This paper apply master-slaver model parallel genetic algorithm (MSM-PGA ) to solve inverse analysis of rock displacement, in the course of solving, has carried on certain improvement to the original algorithm, has resolved the task of the master course and slaver course, and when concrete heredity is operated, having adopted the adaptive hereditary algorithm. The result of emulation experimental shows, MSM-PGA after improving has not merely overcome the shortcoming of original MSM-PGA, and effective improvement the speed and precision of calculation, has guaranteed the dependability of analysis result.
Participation, collaboration and spectatorship in an alternate reality game
Authors: Kenton O'Hara, Hazel Grian, John Williams
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

In this paper we present a study of an Alternate Reality Game (ARG) called MeiGeist -- a cross media game in which narrative elements of a story presented to players across a whole range of on-line and offline media and through which players can interact with in-game characters and events. The study looked at player progress over the eight weeks the game took to play, following their behaviours through the on-line forums, chat rooms and in-game logging of player interactions. The paper explores aspects of collective participation among players, the motivations underlying such participation and the factors that shape these contributions such as timescale of the game. It discusses too, how the narrative is produced and progressed through collective player interactions and how the experience is created through a collaborative suspension of disbelief. Different aspects of participation are also considered, in particular how a more passive spectatorship is an important experience for many players of the game. Finally the game considers how the ideal of a collective ethos among players is sometimes challenged during game play and the efforts necessary to repair this.
Performance evaluation of WiMAX broadband from high altitude platform cellular system and terrestrial coexistence capability
Authors: Z. Yang, A. Mohammed, T. Hult
Venue: EURASIP Journal on Wireless Communications and Networking (2008)

The performance obtained from providing worldwide interoperability for microwave access (WiMAX) from high altitude platforms (HAPs) with multiple antenna payloads is investigated, and the coexistence capability with multiple-operator terrestrial WiMAX deployments is examined. A scenario composed of a single HAP and coexisting multiple terrestrial WiMAX base stations deployed inside the HAP coverage area (with radius of 30 km) to provide services to fixed users with the antenna mounted on the roof with a directive antenna to receive signals from HAPs is proposed. A HAP cellular configuration with different possible reuse patterns is established. The coexistence performance is assessed in terms of HAP downlink and uplink performance, interfered by terrestrial WiMAX deployment. Simulation results show that it is effective to deliver WiMAX via HAPs and share the spectrum with terrestrial systems.
An approach to the design of highly reliable and fail-safe digital systems
Authors: Henry Y. H. Chuang, Santanu Das
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Recent progress in electronic technology has resulted in extensive use of electronic digital or logical systems in many complex control processes where weight or size as well as reliability and safety is important. Typical examples are, to name a few, nuclear reactor control, missile guidance systems, "fly-by-wire" systems in aircraft or spaceship control, and electronic telephone switching systems (ESS). In such applications, if the system is not well protected, some failure could result in a catastrophic accident or unacceptable loss in terms of lives and resources. For the system to be safe and reliable, not only the computers or digital systems in the control loop have to be reliable, but also the sub-systems which take part in the data acquisition or control should be fail-safe and reliable. In order to lessen the chance of system breakdown and unsafe failures in applications of this nature, many protective methods have been proposed and studied. Generally, the methods can be classified as: (1) fault-masking approach, where the emphasis is on achieving higher reliability by using redundancy to mask failures, and (2) fail-safe approach where attention is directed to the design of systems in such a way that they take a predetermined safe state whenever failures occur.
Discrete mathematics/structures: how do we deal with the late appreciation problem?
Authors: David Gries, Michael Eckmann, Ali Erkan, James Heliotis
Venue: Journal of Computing Sciences in Colleges (2009)

One big challenge of teaching discrete mathematics/structures ("discrete math" from here on) is not students' appreciation of the material but the timing of this appreciation. Some (many?) students ask "Why do we have to learn all this?" as they study sequences, mathematical induction, counting, probability, etc., relatively early in their college years. Unfortunately, the most convincing answer comes during the subsequent semesters, and it comes in many iterations. Aside from the courses that obviously depend on this branch of mathematics (i.e. Algorithms, Data Structures, etc.), concepts and notation first introduced in discrete math are utilized in technical treatments of computer networking ([1], [5]), computer organization [2], natural language processing (for probabilistic arguments), web sciences (for network structure arguments [3]), modeling, etc.
Optimum algorithm to minimize human interactions in sequential Computer Assisted Pattern Recognition
Authors: Jose Oncina
Venue: Pattern Recognition Letters (2009)

Given a Pattern Recognition task, Computer Assisted Pattern Recognition can be viewed as a series of solution proposals made by a computer system, followed by corrections made by a user, until an acceptable solution is found. For this kind of systems, the appropriate measure of performance is the expected number of corrections the user has to make. In the present work we study the special case when the solution proposals have a sequential nature. Some examples of this type of tasks are: language translation, speech transcription and handwriting text transcription. In all these cases the output (the solution proposal) is a sequence of symbols. In this framework it is assumed that the user corrects always the first error found in the proposed solution. As a consequence, the prefix of the proposed solution before the last error correction can be assumed error free in the next iteration. Nowadays, all the techniques in the literature relies in proposing, at each step, the most probable suffix given that a prefix of the ''correct'' output is already known. Usually the computation of the conditional most probable output is an NP-Hard or an undecidable problem (and then we have to apply some approximations) or, in some simple cases, complex dynamic programming techniques should be used (usually some variant of the Viterbi algorithm). In the present work we show that this strategy is not optimum when we are interested in minimizing the number of human interactions. Moreover we describe the optimum strategy that is simpler (and usually faster) to compute.
Analysis and parametric modeling of RF MEMS capacitive shunt switch
Authors: Hazem Hassan, Hassan Ibrahim, Nidal Abu Ghalioun
Venue: Proceedings of the 6th conference on Microelectronics, nanoelectronics, optoelectronics (2007)

MEMS capacitive shunt switches with variable resonant frequencies are discussed in this paper. Advantages of such switches are low-loss performance (< 0.5dB), high isolation (> 40 dB), high capacitance ratio, low actuation voltage, and ease of fabrication. The switches are placed over a 45/60/45 (um) copper CPW and a FEM simulation software (Ansoft HFSS) is used to extract the S-parameter for different switch geometries. An equivalent lumped circuit model is constructed from the S-parameters and different values of inductance are calculated. The capacitance of the switches in the down-state is around 5.1pF and the inductances range from 2pH to 27pH which result in resonant frequency range of 13-50 GHz.
Dual purpose FWT domain spread spectrum image watermarking in real time
Authors: Santi P. Maity, Malay K. Kundu, Seba Maity
Venue: Computers and Electrical Engineering (2009)

Spread spectrum (SS) watermarking for multimedia signal becomes appealing due to its high robustness attribute and is used widely for various applications. Some of these applications essentially demand development of low cost algorithms so that they can be used for real time services such as broadcast monitoring, security in communication etc. In recent time one popular non-conventional application of digital watermarking becomes promising that assesses blindly the QoS (quality of services) of the multimedia services which is expected to be offered by the future generation mobile radio network. Majority of the existing SS watermarking schemes suffer from high computation cost and complexity leading to the difficulty for real time implementation and limits their usage for the above mentioned applications. This paper proposes fast Walsh transform (FWT) based SS image watermarking scheme that serves the dual purposes of authentication in data transmission as well as QoS assessment for digital media through dynamic estimation of the wireless channel condition. Fast Walsh transform offers low computation cost for implementation, smaller change in image (multimedia signal) information due to data embedding and ease of hardware realization. VLSI implementation using field programmable gate array (FPGA) has been developed to make it suitable for real time implementation.