ppxscal/embedding_network huggingface dataset:
Homogenous Urban Poverty Clusters within the City of Bari
Authors: Francesco Campobasso, Annarita Fanizzi, Paola Perchinunno
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

This work aims to determine homogenous urban poverty clusters within the City of Bari based on the most recent available data released by ISTAT (Italian National Statistics Institute) in the last General Population and Residential Census (2001). In particular, techniques of fuzzy grouping have been used in order to better compare the different clusters. The use of thesetechniques makes it possible to determine three different groupings of census sections, which are sufficiently homogenous in themselves and heterogeneous with each other in terms of urban poverty.
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
Authors: Jan-Georg Smaus
Venue: Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2007)

A linear pseudo-Boolean constraint (LPB) is an expression of the form a 1·¿1 + ... + a m ·¿ m ¿ d, where each ¿ i is a literal (it assumes the value 1 or 0 depending on whether a propositional variable x i is true or false) and a 1,...,a m ,d are natural numbers. An LPB is a generalisation of a propositional clause, on the other hand it is a restriction of integer linear programming. LPBs can be used to represent Boolean functions more compactly than the well-known conjunctive or disjunctive normal forms. In this paper, we address the question: how much more compactly? We compare the expressiveness of a single LPB to that of related formalisms, and give an algorithm for computing an LPB representation of a given formula if this is possible.
Optimized algorithms for multi-agent routing
Authors: Akihiro Kishimoto, Nathan Sturtevant
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to this problem typically use bids computed using the shortest distance between various locations on a map. But, the cost of this shortest-distance computation has not been considered in previous research. This paper presents a new auction-based algorithm, FASTBID, that works to reduce the computational costs associated with bidding in the multi-robot routing problem. We also analyze how a small modification in the bidding algorithm can reduce the computational load of the bidding process. Experiments demonstrate that FASTBID not only scales much better than previous approaches, but does so with little or no loss in solution quality.
Risk Assessment Method Based on Business Process-Oriented Asset Evaluation for Information System Security
Authors: Jung-Ho Eom, Seon-Ho Park, Young-Ju Han, Tai-Myoung Chung
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

We presented risk assessment methodology focused on business-process oriented asset evaluation and qualitative risk analysis method. The business process-oriented asset evaluation is to evaluate asset's value by the degree of asset contribution related to business process. Namely, asset's value is different according to the importance of department to which asset belongs, the contribution of asset's business, and security safeguard, etc. We proposed new asset's value evaluation applied to the weight of above factors. The weight is decided by evaluation matrix by Delphi team. We assess risk by qualitative method applied to the improved international standard method which is added the effectiveness of operating safeguard at information system. It reflects an assumption that they can reduce risk level when existent safeguards are established appropriately. Our model derives to practical risk assessment method than existent risk assessment method, and improves reliability of risk analysis.
Observations, measurements and semantic reference spaces
Authors: Florian Probst
Venue: Applied Ontology (2008)

What is needed to enable communication about observation and measurement results in information systems? Information system ontologies make a certain conceptualization explicit and partially account for the meanings of symbols associated with this conceptualization. Yet, the meaning of signs denoting measurement results such as &ldquo;10 m&rdquo;, &ldquo;red&rdquo; or &ldquo;high&rdquo; cannot be specified with currently available ontologies. They fail to separate the ontological nature of some observable quality from the specification of how to observe and name the measurement result. We employ the foundational ontology DOLCE for characterizing the ontological nature of observable magnitudes. This involves dealing with ontological questions like &ldquo;What kinds of observable qualities exist, in which entity does the observed quality inhere and how are the magnitudes of the observed quality structured?&rdquo;. Then, in order to capture the semantic aspects of an observation result, we introduce semantic reference spaces, which help deal with semantic questions like &ldquo;Do the signs &ldquo;10 m&rdquo;, &ldquo;33 feet&rdquo; or &ldquo;shallow&rdquo; have the same meaning? Do these signs refer to the same entity, e.g. the depth magnitude of a lake? How to establish a unit of measure?". We posit that the semantic questions can be approached efficiently only if agreement is reached on the ontological questions, and show that the specification of the meaning of signs denoting measurement results is enabled via the extension of the foundational ontology DOLCE with semantic reference spaces. This work was conducted while the author (Probst) was working at the Institute for Geoinformatics, University of M&uuml;nster, Germany.
Coupon Recalculation for the GPS Authentication Scheme
Authors: Georg Hofferek, Johannes Wolkerstorfer
Venue: Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications (2008)

Equipping branded goods with RFID tags is an effective measure to fight the growing black market of counterfeit products. Asymmetric cryptography is the technology of choice to achieve strong authentication but suffers from its ample demand of area and power resources. The GPS authentication scheme showed that a coupon-based approach can cope with the limited resources of passive RFID tags. This article extends the idea of coupons by recalculating coupons during the idle time of tags when they are powered but do not actively communicate. This approach relaxes latency requirements and allows to implement GPS hardware using only 800 gate equivalents plus storage for 560 bytes. In the average case it has the same performance as the classical coupon-based approach but does not suffer its susceptibility to denial-of-service attacks.
Third International Workshop on Model Driven Development of Advanced User Interfaces
Authors: Andreas Pleuß, Jan Bergh, Stefan Sauer, Daniel Görlich, Heinrich Hußmann
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

The workshop Model Driven Development of Advanced User Interfaces (MDDAUI) aims at integrating results from the area of human-computer interaction and user interface modeling with the concepts of model-driven engineering. This paper provides a summary on the third edition of MDDAUI held as part of the MoDELS 2007 conference in Nashville, USA. In particular, it presents the results of the two group discussions of the workshop.
Tamil Question Classification Using Morpheme Features
Authors: S. Lakshmana Pandian, T. V. Geetha
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

Question classification plays an important role in question answering systems. This paper presents the Conditional Random field (CRF) model based on Morpheme features for Tamil question classification. It is a process that analyzes a question and labels it based on its question type and expected answer type (EAT). The selected features are the morpheme parts of the question terms and its dependent terms. The main contribution in this work is in the way of selection of features for constructing CRF Model. They discriminates the position of expected answer type information with respect to question term's position. The CRF model to find out the phrase which contains the information about EAT is trained with tagged question corpus. The EAT is semantically derived by analyzing the phrase obtained from CRF engine using WordNet. The performance of this morpheme based CRF model is compared with the generic CRF engine.
An Analysis and a Reproof of Hmelevskii's Theorem
Authors: Juhani Karhumäki, Aleksi Saarela
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

We analyze and reprove the famous theorem of Hmelevskii, which states that the general solutions of constant-free equations on three unknowns are finitely parameterizable, that is expressible by a finite collection of formulas of word and numerical parameters. The proof is written, and simplified, by using modern tools of combinatorics on words. As a new aspect the size of the finite representation is estimated; it is bounded by a double exponential function on the size of the equation.
Construction and Evaluation of a Robot Dance System
Authors: Kuniya Shinozaki, Akitsugu Iwatani, Ryohei Nakatsu
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

Dance is one form of entertainment where physical movement is the key factor. The main reason why robots are experiencing a kind of "boom" is that they have a physical body. We propose a robot dance system that combines these two elements. First, various factors concerning entertainment and dance are studied. Then we propose the dance system by robot using motion unit and the synthetic rule referring the speech synthesis. Also we describe the details of the system by focusing on its software functions. Finally we show the evaluation results of robot dance performances.
A Hybrid Learning Course on Software Development--Requirements Validation of Tool Support
Authors: Y. T. Yu, M. Y. Choy, E. Y. Chan, Y. T. Lo
Venue: Proceedings of the 1st international conference on Hybrid Learning and Education (2008)

Learning of software development demands not only adequate supervision by the instructor, but also intensive interactions among students. In traditional classroom learning, the number of contact hours between the instructor and students is very limited. This severely restricts the amount of guidance and learning that students may receive in a course. In particular, the best practices in software development, such as design modelling, peer review, quality assurance and project management, all require ample practice that is hardly feasible in the traditional classroom learning setting. Supported by e-learning systems and tools, a large part of the interactions between instructors and students can now be done online. We propose a hybrid learning design of software development courses to take advantage of both the rich context available in classroom learning and the benefits of electronic communications. This paper presents the rationale for hybrid learning in such courses, and describes a pilot hybrid learning course on software development for preliminary evaluation and requirements validation of tool support.
UNED at Answer Validation Exercise 2007
Authors: Álvaro Rodrigo, Anselmo Peñas, Felisa Verdejo
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

The objective of the Answer Validation Exercise (AVE) 2007 is to develop systems able to decide if the answer to a question is correct or not. Since it is expected that a high percentage of the answers, questions and supporting snippets contain named entities, the paper presents a method for validating answers that uses only information about named entities. The promising results encourage us to improve the system and use it as a component of other systems.
Building a Family of Compilers
Authors: Wonseok Chae, Matthias Blume
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

We have developed and maintained a set of closely related compilers. Although much of their code is duplicated and shared, they have been maintained separately because they are treated as different compilers. Even if they were merged together, the combined code would become too complicated to serve as the base for another extension. We describe our experience to address this problem by adopting the product line engineering paradigm to build a family of compilers. This paradigm encourages developers to focus on developing a set of compilers rather than on developing one particular compiler. We show engineering activities for a family of compilers from product line analysis through product line architecture design to product line component design. Then, we present how to build particular compilers from core assets resulting from the previous activities and how to take advantage of modern programming language technology to organize this task. Our experience demonstrates that the product line engineering as a developing paradigm can ease the construction of a family of compilers.
Rapid Development of Web Interfaces to Heterogeneous Systems
Authors: José Paulo Leal, Marcos Aurélio Domingues
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

The general problem addressed in this paper is the rapid development of web interfaces to software systems using only their command line interface. This kind of system is frequently developed in environments that greatly differ from those where web interface will be implemented. In this setting it is also important to maintain a loose coupling between the web interface and the system it controls since the latter must be able to continue its normal development independently of the former.We propose a framework to develop web interfaces targeted to these systems whose main feature is the fact that it can be extended without requiring code programming. The hot spots of our framework are XML configuration files to define the interface data, how this data is mapped into the system's commands, and how commands output and the interaction state is mapped into web formatting languages. With this approach the web interface is kept separated from the system it controls, it is easy to define and modify, and is able to capture enough domain knowledge to be a real advantage for the novice or sporadic user.In this paper we present the proposed framework architecture, loosely inspired in the MVC pattern, its implementation on Java servlet containers, and its application to the AGILMAT system, a high-school mathematical problem generator developed using constrained grammars.
Chemical bonds in damaged and pristine low-κ materials: A comparative EELS study
Authors: Heiko Stegmann, V. Burak Özdöl, Christoph Koch, Peter A. van Aken, Hans-Jürgen Engelmann, Pavel Potapov, Ehrenfried Zschech
Venue: Microelectronic Engineering (2008)

Chemical bonds in low-@k dielectric materials can be studied at nanometer spatial resolution using electron energy loss spectroscopy (EELS) in a monochromated transmission electron microscope (TEM). However, it is unknown to what extent TEM sample preparation and exposure to the electron beam during the measurement alter the original chemical bond state in these materials. Therefore, we are assessing the effect of different TEM sample preparation methods and beam conditions in a comparative study on low-@k dielectric materials.
A Vector Processor Based on One-Bit Microprocessors
Authors: Wayne Loucks, Martin Snelgrove, Safwat Zaky
Venue: IEEE Micro (1982)

This low-cost auxiliary processor is based on commercially available microprocessors. Its parallel capabilities enhance the performance of small computer systems in vector and associative operations.
Improvement of ANNs Performance to Generate Fitting Surfaces for Analog CMOS Circuits
Authors: José Ángel Díaz-Madrid, Pedro Monsalve-Campillo, Juan Hinojosa, María Victoria Rodellar Biarge, Ginés Doménech-Asensi
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

One of the typical applications of neural networks is based on their ability to generate fitting surfaces. However, for certain problems, error specifications are very restrictive, and so, the performance of these networks must be improved. This is the case of analog CMOS circuits, where models created must provide an accuracy which some times is difficult to achieve using classical techniques. In this paper we describe a modelling method for such circuits based on the combination of classical neural networks and electromagnetic techniques. This method improves the precision of the fitting surface generated by the neural network and keeps the training time within acceptable limits.
Using a (Higher-Order) Magnus Method to Solve the Sturm-Liouville Problem
Authors: Veerle Ledoux, Marnix Daele, Guido Berghe
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

The main purpose of this paper is to describe techniques for the numerical solution of a Sturm-Liouville equation (in its Schrödinger form) by employing a Magnus expansion. With a suitable method to approximate the highly oscillatory integrals which appear in the Magnus series, high order schemes can be constructed. A method of order ten is presented. Even when the solution is highly-oscillatory, the scheme can accurately integrate the problem using stepsizes typically much larger than the solution "wavelength". This makes the method well suited to be applied in a shooting process to locate the eigenvalues of a boundary value problem.
The Roman Domination Problem in Unit Disk Graphs
Authors: Weiping Shang, Xiaodong Hu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Unit disk graphs are the intersection graphs of equal sized disks in the plane, they are widely used as a mathematical model for wireless ad-hoc networks and some problems in computational geometry. In this paper we first show that the Roman domination problem in unit disk graphs is NP-hard, and then present a simple linear time approximation algorithm and a polynomial-time approximation scheme for this problem, respectively.
Fuzzy Q-Map Algorithm for Reinforcement Learning
Authors: Youngah Lee, Seokmi Hong
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

In reinforcement learning, it is important to get nearly right answers early. Good prediction early can reduce the prediction error afterward and accelerate learning speed. We propose Fuzzy Q-Map, function approximation algorithm based on on-line fuzzy clustering in order to accelerate learning. Fuzzy Q-Map can handle the uncertainty owing to the absence of environment model. Appling membership function to reinforcement learning can reduce the prediction error and destructive interference phenomenon caused by changes of the distribution of training data. In order to evaluate fuzzy Q-Map's performance, we experimented on the mountain car problem and compared it with CMAC. CMAC achieves the prediction rate 80% from 250 training data, Fuzzy Q-Map learns faster and keep up the prediction rate 80% from 250 training data. Fuzzy Q-Map may be applied to the field of simulation that has uncertainty and complexity.
A Model-Driven Approach to Content Repurposing
Authors: Zeljko Obrenovic, Dusan Starcevic, Bran Selic
Venue: IEEE MultiMedia (2004)

The Multimedia Metamodel defines platform-independent multimedia concepts, opening the way for novel approaches to designing content repurposing solutions. Designers can use the metamodel to create content and add metadata to existing content, simplifying content analysis and repurposing.
LV Motion and Strain Computation from tMRI Based on Meshless Deformable Models
Authors: Xiaoxu Wang, Ting Chen, Shaoting Zhang, Dimitris Metaxas, Leon Axel
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

We propose a novel meshless deformable model for in vivo Left Ventricle (LV) 3D motion estimation and analysis based on tagged MRI (tMRI). The meshless deformable model can capture global deformations such as contraction and torsion with a few parameters, while track local deformations with Laplacian representation. In particular, the model performs well even when the control points (tag intersections) are relatively sparse. We test the performance of the meshless model on a numeric phantom, as well as in vivo heart data of healthy subjects and patients. The experimental results show that the meshless deformable model can fully recover the myocardial motion and strain in 3D.
Keystroke Dynamics for Biometrics Identification
Authors: Michał Choraś, Piotr Mroczkowski
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

Personal identification has lately become a very important issue in the still evolving network society. Biometrics identification methods proved to be very efficient, more natural and easy for users than traditional methods of human identification. Hereby we discuss the idea of human identification based on keystroke dynamics. In the article we focus on our methods of feature extraction from the typing patterns. Moreover, we present satisfactory experimental results and possible applications of keystroke biometrics.
Optics: A Maturing Technology for Better Computing
Authors: Leo J. Irakliotis, Pericles A. Mitkas
Venue: Computer (1998)

This issue presents a tutorial introduction to the field of optical information processing, in particular, digital optical computing. We present current trends in optical computing research, in the hopes of a closer interaction with the broader computer science and engineering community.
Complex Workflow Management of the CAM Global Climate Model on the GRID
Authors: V. Fernández-Quiruelas, J. Fernández, A. S. Cofiño, C. Baeza, F. García-Torre, R. M. San Martín, R. Abarca, J. M. Gutiérrez
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Recent trends in climate modeling find in GRID computing a powerful way to achieve results by sharing computing and data distributed resources. In particular, ensemble prediction is based on the generation of multiple simulations from perturbed model conditions to sample the existing uncertainties. In this work, we present a GRID application consisting of a state-of-the-art climate model (CAM) [1]. The main goal of the application is providing a user-friendly platform to run ensemble-based predictions on the GRID. This requires managing a complex workflow involving long-term jobs and data management in a user-transparent way. In doing so, we identified the weaknesses of current GRID middleware tools and developed a robust workflow by merging the optimal existing applications with an underlying self-developed workflow.