ppxscal/embedding_network huggingface dataset:
Skew-Frobenius Maps on Hyperelliptic Curves
Authors: Shunji Kozaki, Kazuto Matsuo, Yasutomo Shimbara
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Scalar multiplication methods using the Frobenius maps are known for efficient methods to speed up (hyper)elliptic curve cryptosystems. However, those methods are not efficient for the cryptosystems constructed on fields of small extension degrees due to costs of the field operations. Iijima et al. showed that one can use certain automorphisms on the quadratic twists of elliptic curves for fast scalar multiplications without the drawback of the Frobenius maps. This paper shows an extension of the automorphisms on the Jacobians of hyperelliptic curves of arbitrary genus.
Particle swarm optimized multiple regression linear model for data classification
Authors: Suresh Chandra Satapathy, J. V. R. Murthy, P. V. G. D. Prasad Reddy, B. B. Misra, P. K. Dash, G. Panda
Venue: Applied Soft Computing (2009)

This paper presents a new data classification method based on particle swarm optimization (PSO) techniques. The paper discusses the building of a classifier model based on multiple regression linear approach. The coefficients of multiple regression linear models (MRLMs) are estimated using least square estimation technique and PSO techniques for percentage of correct classification performance comparisons. The mathematical models are developed for many real world datasets collected from UCI machine repository. The mathematical models give the user an insight into how the attributes are interrelated to predict the class membership. The proposed approach is illustrated on many real data sets for classification purposes. The comparison results on the illustrative examples show that the PSO based approach is superior to traditional least square approach in classifying multi-class data sets.
Generation of 3D Building Model Using 3D Line Segments
Authors: Dong-Min Woo
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper presents a new method for building rooftop detection from aerial images. In our approach, we extract useful building location information from the generated disparity map to segment the interested objects and consequently reduce unnecessary line segments extracted in the low level feature extraction step. Hypothesis selection is carried out by using an undirected graph, in which close cycles represent complete rooftops hypotheses. We test the proposed method with the synthetic images generated from Avenches dataset of Ascona aerial images. The experiment result shows that the extracted 3D line segments of the reconstructed buildings have an average error of 1.69m and our method can be efficiently used for the task of building detection and reconstruction from aerial images.
Earth resources
Authors: Leigh S. Rosenberg
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The purpose of this session is to present a cross-section of talks relating to the current state of computer simulation modeling as applied to solar energy systems. This field is of major importance today because of the national need to explore alternative energy sources in a quick, comprehensive, and inexpensive manner. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Model Checking Biological Oscillators
Authors: Ezio Bartocci, Flavio Corradini, Emanuela Merelli, Luca Tesei
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We define a subclass of timed automata, called oscillator timed automata, suitable to model biological oscillators. The semantics of their interactions, parametric w.r.t. a model of synchronization, is introduced. We apply it to the Kuramoto model. Then, we introduce a logic, Kuramoto Synchronization Logic (KSL), and a model checking algorithm in order to verify collective synchronization properties of a population of coupled oscillators.
Anger and flaming in computer-mediated negotiation among strangers
Authors: Norman A. Johnson, Randolph B. Cooper, Wynne W. Chin
Venue: Decision Support Systems (2009)

The present study explores the antecedents of the antinormative hostile communication of emotion, termed flaming, in the context of computer-mediated negotiation. We find that flaming is associated with anger directed toward the negotiating context; this can occur when a negotiator becomes frustrated due to problems with communication channel characteristics or due to uncertainty surrounding the negotiation task. We also find that flaming is associated with anger directed toward a negotiator's partner, which can occur when a negotiator perceives that the partner is being unfair. We find further that anger totally mediates the relationships between flaming and its antecedents. These findings provide the basis to argue that anger reduction can effectively decrease flaming, independent of the existence of flaming antecedents, such as unfairness. We therefore provide suggestions that can help with the reduction of anger in such circumstances.
Disjoint congruence classes and a timetabling application
Authors: Geir Dahl
Venue: Discrete Applied Mathematics (2009)

We consider a combinatorial problem motivated by a special simplified timetabling problem for subway networks. Mathematically the problem is to find (pairwise) disjoint congruence classes modulo certain given integers; each such class corresponds to the arrival times of a subway line of a given frequency. For a large class of instances we characterize when such disjoint congruence classes exist and how they may be determined. We also study a generalization involving a minimum distance requirement between congruence classes, and a comparison of different frequency families in terms of their ''efficiency''. Finally, a general method based on integer programming is also discussed.
Query-Driven Program Testing
Authors: Andreas Holzer, Christian Schallhart, Michael Tautschnig, Helmut Veith
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

We present a new approach to program testing which enables the programmer to specify test suites in terms of a versatile query language. Our query language subsumes standard coverage criteria ranging from simple basic block coverage all the way to predicate complete coverage and multiple condition coverage, but also facilitates on-the-fly requests for test suites specific to the code structure, to external requirements, or to ad hoc needs arising in program understanding/exploration. The query language is supported by a model checking backend which employs the CBMC framework. Our main algorithmic contribution is a method called iterative constraint strengthening which enables us to solve a query for an arbitrary coverage criterion by a single call to the model checker and a novel form of incremental SAT solving: Whenever the SAT solver finds a solution, our algorithm compares this solution against the coverage criterion, and strengthens the clause database with additional clauses which exclude redundant new solutions. We demonstrate the scalability of our approach and its ability to compute compact test suites with experiments involving device drivers, automotive controllers, and open source projects.
Visual Immersive Haptic Mathematics in Shared Virtual Spaces
Authors: Alexei Sourin, Olga Sourina, Lei Wei, Paul Gagnon
Venue: Transactions on Computational Science III (2009)

When teaching subjects richly infused with mathematics, in particular geometry, topology and shape modeling, there is a frequent problem that the learners are not able to "visualize" the attendant theoretical concepts. It is important, therefore, to constantly illustrate the associated theories with practical visual exercises, which are preferably to be done in collaboration with other learners to allow them to discuss possible approaches to the problem and to consult with the instructor, virtually or face-to-face. We have proposed an approach that would allow for solving mathematical problems while being immersed within shared virtual 3D collaborative environments. Only mathematical formulas are used by the learners for immediate interactive definition of geometry, appearance and physical property of the shapes being created in the virtual environment. We target learners and educators who are studying subjects rich in mathematics and geometry, or teaching them at the secondary or tertiary level or doing research on these topics. The process allows the learners to see and feel the geometric meaning of mathematics, thus making it less abstract and more perceptual and tangible. We also see ways of incorporating beneficial uses of immersive virtual environments into traditional courses at Universities which might benefit from 3D visualization.
Ten Thousand Cents
Authors: Takashi Kawashima, Aaron Koblin
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

Ten Thousand Cents is a digital artwork that creates a representation of a US $100 bill. Using a custom drawing tool, thousands of individuals working in isolation from one another painted tiny parts of the bill with no knowledge of the overall task. Workers were paid one cent each via Amazon's Mechanical Turk distributed labor tool. The total labor cost to create the bill, the artwork created, and the reproductions available for purchase are all $100. The work is presented as a video piece with all 10,000 parts being drawn simultaneously. The project explores the circumstances we live in, a new and uncharted combination of digital labor markets, "crowdsourcing," "virtual economies," and digital reproduction.
Integrating OGC Web Processing Services into Geospatial Mass-Market Applications
Authors: Theodor Foerster, Bastian Schaeffer, Johannes Brauner, Simon Jirka
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

Enabling the integration of information provided by OGC Web Processing Services into geospatial mass-market applications is promising, as it increases the availability of information for most ordinary users. This information will be most likely based on the latest available data (e.g. collected by sensors) and can thereby support the user in time-constrained decisions. This paper presents an approach to actually configure and integrate such processes into geospatial mass-market applications. The applicability of the approach is demonstrated by a risk management scenario. The software presented has been developed within the Geoprocessing Community of the 52°North initiative and is available through an Open Source license.
AOCI: ontology-based pointcuts
Authors: Guido Söldner, Rüdiger Kapitza, Sven Schober
Venue: Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software (2009)

In this paper, we propose ontology-based pointcuts, a novel mechanism based on the ideas of AOP, the separation of concerns and system modularization, to enhance components, thus making them more adaptable and evolvable. The core idea of ontologybased pointcuts is to specify pointcuts in terms of ontological concepts instead of patterns that are matched against source code. Components are usually considered as black boxes that can be combined to a complex system using their outer interfaces. In the context of our infrastructure, components are extended by exporting possible adaptation points, which are enriched by ontological information. This ontological metadata represents concepts from a domain model, defined by a domain expert. The ontology is implemented within an intermediate layer that decouples the matching pointcuts from the concrete source level within the components. This enables the application of AOP techniques without detailed knowledge about the component's internals, enabling dynamic and distributed adaptation and reducing the fragile pointcut problem to the component scope. This paper presents the design and the expressiveness of the ontology-based pointcuts. We show several practical examples how to use joinpoint model and the pointcut specification followed by a short discussion.
Paths, cycles and circular colorings in digraphs
Authors: Guanghui Wang, Guizhen Liu
Venue: Theoretical Computer Science (2009)

In this paper, we consider the paths, cycles and circular colorings of digraphs. Let D be a digraph. We show that if the complement of D contains no directed Hamiltonian cycle, then @g"c(D)=@g(D). Also, we give two results which concern directed paths meeting all colors in digraphs with proper colorings.
Optimal service channel reconfiguration based on multi-agent simulation
Authors: Jin Yan Shao, Ming Xie, Li Xia, Wen Jun Yin, Jin Dong
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Solving the problem of long queues becomes increasingly urgent in many on-site service outlets. For example, in a bank branch or a government agency, customers may have to wait for a very long time to be served. How to optimally reconfigure the capability of service channels in such outlets is a key for the service providers to improve efficiency and quality of service. In this paper, we propose a method to optimally configure service channels at a given service outlet. We integrate customer experience metrics with cost and profit into a unified objective function for optimization. Multi-agent simulation technique is employed to model the stochastic service processes and customer behavior, and to evaluate the objective function in optimizing service channel capacity. Some real-life data collected from bank branches provide significant empirical support to the method and demonstrate that the presented method is both effective and efficient.
Using Enhanced Wiki-based Solutions for Managing Requirements
Authors: Oezguer Uenalan, Norman Riegel, Sebastian Weber, Joerg Doerr
Venue: Proceedings of the 2008 First International Workshop on Managing Requirements Knowledge (2008)

The main phases during requirements engineering include the elicitation, specification, validation, and management of requirements in order to understand what the system must do. In the age of distributed and collaborative work, suitable tools and concepts are needed to support requirements activities in this context. Based on requirements derived from basic practices of the ReqMan framework, we will introduce first solution concepts for a wiki-based requirements management tool..
Effective and efficient compromise recovery for weakly consistent replication
Authors: Prince Mahajan, Ramakrishna Kotla, Catherine C. Marshall, Venugopalan Ramasubramanian, Thomas L. Rodeheffer, Douglas B. Terry, Ted Wobber
Venue: Proceedings of the 4th ACM European conference on Computer systems (2009)

Weakly consistent replication of data has become increasingly important both for loosely-coupled collections of personal devices and for large-scale infrastructure services. Unfortunately, automatic replication mechanisms are agnostic about the quality of the data they replicate. Inappropriate updates, whether malicious or simply the result of misuse, propagate automatically and quickly. The consequences may not be noticed until days later, when the corrupted data has been fully replicated, thereby deleting or overwriting all traces of the valid data. In this sort of situation, it can be hard or impossible to restore an entire distributed system to a clean state without losing data and disrupting users. Polygraph is a software layer that extends the functionality of weakly consistent replication systems to support compromise recovery. Its goal is to undo the direct and indirect effects of updates due to a source known after the fact to have been compromised. In restoring a clean replicated state, Polygraph expunges all data due to a compromise or derived from such data, retains as much uncompromised data as possible, and revives valid versions of subsequently compromised data. Our evaluation demonstrates that Polygraph is both effective, retaining uncompromised data, and efficient, re-replicating data only when necessary.
The Research on Safety Monitoring System of Coal Mine Based on Spatial Data Mining
Authors: Chang'an Shao, Qiang Wu, Xin Guan
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Based on the characteristics of Coal Mine safety information -- activity, dynamic changes, closely related to the space, this paper puts forward the project about the Safety Monitoring System of Coal Mine Based on Spatial Data Mining ,and builds a coal mine Safety Monitoring System model based on Spatial Data Mining and GIS technology. The Safety Monitoring System of Coal Mine will fundamentally reduce the occurrence of coal mine disasters, and improve the level of coal mine safety management.
Keyword programming in Java
Authors: Greg Little, Robert C. Miller
Venue: Automated Software Engineering (2009)

Keyword programming is a novel technique for reducing the need to remember details of programming language syntax and APIs, by translating a small number of unordered keywords provided by the user into a valid expression. In a sense, the keywords act as a query that searches the space of expressions that are valid in the given context. Prior work has demonstrated the feasibility and merit of this approach in limited domains. This paper explores the potential for employing this technique in much larger domains, specifically general-purpose programming languages like Java. We present an algorithm for translating keywords into Java method call expressions. When tested on keywords extracted from existing method calls in Java code, the algorithm can accurately reconstruct over 90% of the original expressions. We tested the algorithm on keywords provided by users in a web-based study. The results suggest that users can obtain correct Java code using keyword queries as accurately as they can write the correct Java code themselves. We implemented the algorithm in an Eclipse plug-in as an extension to the autocomplete mechanism and deployed it in a preliminary field study of several users, with mixed results. One interesting result of this work is that most of the information in Java method call expressions lies in the keywords, and details of punctuation and even parameter ordering can often be inferred automatically.
The Harmony Integration Workbench
Authors: Peter Mork, Len Seligman, Arnon Rosenthal, Joel Korb, Chris Wolf
Venue: Journal on Data Semantics XI (2008)

A key aspect of any data integration endeavor is determining the relationships between the source schemata and the target schema. This schema integration task must be tackled regardless of the integration architecture or mapping formalism. In this paper, we provide a task model for schema integration. We use this breakdown to motivate a workbench for schema integration in which multiple tools share a common knowledge repository. In particular, the workbench facilitates the interoperation of research prototypes for schema matching (which automatically identify likely semantic correspondences) with commercial schema mapping tools (which help produce instance-level transformations). Currently, each of these tools provides its own ad hoc representation of schemata and mappings; combining these tools requires aligning these representations. The workbench provides a common representation so that these tools can more rapidly be combined.
Improved Fading Scheme for Spatio-Temporal Error Concealment in Video Transmission
Authors: Min-Cheol Hwang, Jun-Hyung Kim, Chun-Su Park, Sung-Jea Ko
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Error concealment at a decoder is an efficient method to reduce the degradation of visual quality caused by channel errors. In this paper, we propose a novel spatio-temporal error concealment algorithm based on the spatial-temporal fading (STF) scheme which has been recently introduced. Although STF achieves good performance for the error concealment, several drawbacks including blurring still remain in the concealed blocks. To alleviate these drawbacks, in the proposed method, hybrid approaches with adaptive weights are proposed. First, the boundary matching algorithm and the decoder motion vector estimation which are well-known temporal error concealment methods are adaptively combined to compensate for the defect of each other. Then, an edge preserved method is utilized to reduce the blurring effects caused by the bilinear interpolation for spatial error concealment. Finally, two concealed results obtained by the hybrid spatial and temporal error concealment are pixel-wisely blended with adaptive weights. Experimental results exhibit that the proposed method outperforms conventional methods including STF in terms of the PSNR performance as well as subjective visual quality, and the computational complexity of the proposed method is similar to that of STF.
How NOT to review a paper: the tools and techniques of the adversarial reviewer
Authors: Graham Cormode
Venue: ACM SIGMOD Record (2009)

There are several useful guides available for how to review a paper in Computer Science [10, 6, 12, 7, 2]. These are soberly presented, carefully reasoned and sensibly argued. As a result, they are not much fun. So, as a contrast, this note is a checklist of how not to review a paper. It details techniques that are unethical, unfair, or just plain nasty. Since in Computer Science we often present arguments about how an adversary would approach a particular problem, this note describes the adversary's strategy.
The decomposition of the hypermetric cone into L-domains
Authors: Mathieu Dutour Sikirić, Viatcheslav Grishukhin
Venue: European Journal of Combinatorics (2009)

The hypermetric cone HY Pn+1 is the parameter space of basic Delaunay polytopes of n-dimensional lattice. If one fixes one Delaunay polytope of the lattice then there are only a finite number of possibilities for the full Delaunay tessellations. So, the cone HY Pn+1 is the union of a finite set of L-domains, i.e. of parameter space of full Delaunay tessellations. In this paper, we study this partition of the hypermetric cone into L-domains. In particular, we prove that the cone HY Pn+1 of hypermetrics on n+1 points contains exactly ½n! principal L-domains. We give a detailed description of the decomposition of HY Pn+1 for n=2,3,4 and a computer result for n=5. Remarkable properties of the root system D4 are key for the decomposition of HY P5.
Mobile computing in healthcare: the dreams and wishes of clinicians
Authors: John Luo
Venue: Proceedings of the 2nd International Workshop on Systems and Networking Support for Health Care and Assisted Living Environments (2008)

Physicians and other health care providers are often slower to adopt newer technologies in comparison to the other industries. Reasons for slow adoption include the anxiety of learning how to use new hardware, the frustration with constant technological change, and hesitancy to get out of an established routine. This talk will briefly review some of the psychology behind resistance to change and adoption of new technologies, and highlight strategies in encouraging the healthcare industry to quickly adapt to the exciting and new technologies.