ppxscal/embedding_network huggingface dataset:
Using Online Public Services: A Measurement of Citizens' Operational, Formal, Information and Strategic Skills
Authors: Alexander Deursen, Jan Dijk
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

It is important to take digital inequality research in consideration when focusing on electronic public service delivery. From this point of view, this paper considers four digital skills that citizens need when using online public services. Measurements of these skills in the Netherlands indicate that on average 80% of the operational skill Internet assignments, 72% of formal Internet skills assignments, 62% of the information Internet skills assignments and 25% of strategic Internet skills assignments have been successfully completed. Performances are significantly different for people with high, medium and low level of education attained and in some cases for people with different age. The Dutch government's expectation that every citizen with an Internet connection is able to complete the assignments clearly is not justified.
Using specularities in comparing 3D models and 2D images
Authors: Margarita Osadchy, David Jacobs, Ravi Ramamoorthi, David Tucker
Venue: Computer Vision and Image Understanding (2008)

We aim to create systems that identify and locate objects by comparing known, 3D shapes to intensity images that they have produced. To do this we focus on verification methods that determine whether a known model in a specific pose is consistent with an image. We build on prior work that has done this successfully for Lambertian objects, to handle a much broader class of shiny objects that produce specular highlights. Our core contribution is a novel method for determining whether a known 3D shape is consistent with the 2D shape of a possible highlight found in an image. We do this using only a qualitative description of highlight formation that is consistent with most models of specular reflection, so no specific knowledge of an object's specular reflectance properties is needed. This allows us to treat non-Lambertian image effects as a positive source of information about object identity, rather than treating them as a potential source of noise. We then show how to integrate information about highlights into a system that also checks the consistency of Lambertian reflectance effects. Also, we show how to model Lambertian reflectance using a reference image, rather than albedos, which can be difficult to measure in shiny objects. We test each aspect of our approach using several different data sets. We demonstrate the potential value of our method of handling specular highlights by building a system that can locate shiny, transparent objects, such as glassware, on table tops. We demonstrate our hybrid methods on pottery, and our use of reference images with face recognition experiments.
Extracting Zing Models from C Source Code
Authors: Tomas Matousek, Filip Zavoral
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

In the paper, we propose an approach to an automatic extraction of verification models for the C language source code. We primarily focus on the representation of pointers and arrays, which make the extraction from the C language specific. We provide an implementation of the model extractor as a part of our broader effort to develop a verifier of Windows kernel drivers based on the Zing model checker. To demonstrate the feasibility of our approach, we give examples of the extraction results on a practical synchronization problem.
Dedicated Hardware Architecture for Partially Mapped Crossover
Authors: Masaya Yoshikawa, Hidekazu Terai
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

This paper discusses new dedicated hardware architecture for partially mapped crossover (PMX). The proposed architecture introduces a new PMX algorithm which is suitable for hardware. It creates the matching-table using a register as preprocessing. The matching-table reduces the number of steps for comparison processing which is required in PMX algorithm. Thus, the proposed architecture requires only one clock cycle for the comparison processing, and achieves the high speed processing. Simulation results show that the proposed architecture achieved five times more high-speed processing than conventional PMX on average.
Evaluating the Viability of Pictometry® Imagery for Creating Models of the Built Environment
Authors: Astrid Jurisch, David Mountain
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

In order to escape the `flat-land' paradigm, still dominant within Geographic Information Systems (GIS), three-dimensional (3D) models are required which can represent both natural and manmade environments. This study investigates the viability of using Pictometry® imagery for creating city models, with particular focus upon the benefits that georeferenced oblique imagery can offer for both geometric modelling and texturing. An approach is presented for the manual creation of a geometric and textured model based on ortho and oblique Pictometry® imagery for a study area in Helsinki. The intended usage is personal orientation and navigation, a Tourist Information System is provided as an use case scenario. Qualitative and quantitative methods were used to evaluate the textured block model. Expert interviews indicate that the textured city model is suitable for the intended purpose. A review of automated 3D modelling techniques identifies the potential for future work combining Pictometry® imagery and LiDAR data.
Unsupervised Acquiring of Morphological Paradigms from Tokenized Text
Authors: Daniel Zeman
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)

This paper describes a rather simplistic method of unsupervised morphological analysis of words in an unknown language. All what is needed is a raw text corpus in the given language. The algorithm looks at words, identifies repeatedly occurring stems and suffixes, and constructs probable morphological paradigms. The paper also describes how this method has been applied to solve the Morpho Challenge 2007 task, and gives the Morpho Challenge results. Although quite simple, this approach outperformed, to our surprise, several others in most morpheme segmentation subcompetitions. We believe that there is enough room for improvements that can put the results even higher. Errors are discussed in the paper; together with suggested adjustments in future research.
On hard instances of approximate vertex cover
Authors: Sundar Vishwanathan
Venue: ACM Transactions on Algorithms (TALG) (2008)

We show that if there is a 2 &minus; &epsis; approximation algorithm for vertex cover on graphs with vector chromatic number at most 2 + &delta;, then there is a 2 &minus; f(&epsis;, &delta;) approximation algorithm for vertex cover for all graphs.
Efficient and Economical Test Equipment Setup Using Procorrelation
Authors: Bin-Hong Lin, Cheng-Wen Wu, Hwei-Tsu Ann Luh
Venue: IEEE Design Test (2004)

The Procorrelation System (PCS) obtains a high-quality correlation between die failures on a premanufactured recorded correlation wafer and the test equipment setup for the current wafer lot. PCS greatly reduces analysis time and test cost, compared with conventional full-wafer probing and offers significant benefits for deep-submicron ICs.
Ontology-Based Business Plan Classification
Authors: Miriam Baglioni, Andrea Bellandi, Barbara Furletti, Laura Spinsanti, Franco Turini
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

The problem of providing Small and Medium Enterprises (SMEs) with good self-assessment tools is becoming moreand more urgent every day, not only because of increasingmarket competition, but also because of new rules for creditgranting, as for example the ones referred to as Basel II.One of the critical issues in designing supporting tools isthe quality of the knowledge embedded in them. We maintain that a better quality of decisions can be obtained byexploiting not only quantitative information but also qualitative information and expert knowledge. Here we presenta system able to classify the quality of innovation plans ofSMEs by exploiting both quantitative and qualitative knowledge embedded in ontology. The ontological approach allows representing qualitative knowledge in a very naturalway and, as a consequence, we are able to elicit it by meansthat are natural for SME officers, as for example questionnaires.
Fuzzy Measurement of the Number of Persons on the Basis of the Photographic Image
Authors: Dariusz Król, Michał Lower
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

The numbers of persons on the hall is often a base of the ventilation control system in big commercial buildings. The paper presents a method dedicated for the measurement of the number of persons on the basis of analysis the registered photographic images. A difference between consecutive frames is estimated in the presented method. Every 5 seconds a change in a frame is being evaluated towards previous one. Medium value of the changes for the period of a few minutes is proportional to the number of persons on the hall. For the implementation the algorithms based on fuzzy logic were used.
An FSM-Based Approach for Malicious Code Detection Using the Self-Relocation Gene
Authors: Yu Zhang, Tao Li, Jia Sun, Renchao Qin
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Most information attacks on the Internet are perpetrated by deploying malicious codes, which results in destructive epidemics. The correct execution of viruses and worms throughout the Internet is accomplished by self-relocation. Self-relocation is a built-in mechanism in most malicious codes, allowing them to get the base address of the host program to correctly infect it. Since most legitimate computer programs do not need self-relocate themselves, the detection of malicious codes could be reduced to the detection of the various mutations of the self-relocation gene. This study presents such a detection mechanism based on finite state machine theory for both known and previously unknown malicious executable codes. It does not rely on signature-screening of known viruses, but instead it detects self-relocation attempt of the suspicious executable code. The experiments were conducted and the results indicate that the proposed approach has better ability to detect known and previously unknown malicious executable codes than other methods.
Radioastronomy Image Synthesis on the Cell/B.E.
Authors: Ana Lucia Varbanescu, Alexander S. Amesfoort, Tim Cornwell, Andrew Mattingly, Bruce G. Elmegreen, Rob Nieuwpoort, Ger Diepen, Henk Sips
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Now that large radiotelescopes like SKA, LOFAR, or ASKAP, become available in different parts of the world, radioastronomers foresee a vast increase in the amount of data to gather, store and process. To keep the processing time bounded, parallelization and execution on (massively) parallel machines are required for the commonly-used radioastronomy software kernels. In this paper, we analyze data gridding and degridding, a very time-consuming kernel of radioastronomy image synthesis. To tackle its its dynamic behavior, we devise and implement a parallelization strategy for the Cell/B.E. multi-core processor, offering a cost-efficient alternative compared to classical supercomputers. Our experiments show that the application running on one Cell/B.E. is more than 20 times faster than the original application running on a commodity machine. Based on scalability experiments, we estimate the hardware requirements for a realistic radio-telescope. We conclude that our parallelization solution exposes an efficient way to deal with dynamic data-intensive applications on heterogeneous multi-core processors.
Designing interaction and animation in YS-3: multi-layered interactive animation device
Authors: Yu Sudo, Masa Inakage
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

YS-3 is an interactive animation device. This device makes it possible to display animations with an actual sense of depth and let a viewer control developments of animations. It has seven plastic displays and each display is inserted into different level of tower-style device. With this structure, all animations on different displays are stacked like multi-layered animations. There is a space between displays. So, it can provide visual experience that cannot be attained by flat-style displays. And a viewer can change the composition of displays in the device. What decides developments of animations is this composition. In this paper, we discuss about effective interaction design and animation design in YS-3. These methods will lead to contents design in visual media different from flat-style display such as a TV screen and a screen.
Language Constructs for Data Partitioning and Distribution
Authors: P. Crooks, R. H. Perrott
Venue: Scientific Programming (1995)

This article presents a survey of language features for distributed memory multiprocessor systems (DMMs), in particular, systems that provide features for data partitioning and distribution. In these systems the programmer is freed from consideration of the low-level details of the target architecture in that there is no need to program explicit processes or specify interprocess communication. Programs are written according to the shared memory programming paradigm but the programmer is required to specify, by means of directives, additional syntax or interactive methods, how the data of the program are decomposed and distributed.
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Venue: International Conference on Autonomous Agents (2008)

AAMAS is the premier scientific conference for research in autonomous agents and multiagent systems. The AAMAS conference series was initiated in 2002 as a merger of three highly respected individual conferences: the International Conference on Autonomous Agents, the International Workshop on Agent Theories, Architectures, and Languages, and the International Conference on Multiagent Systems. The aim of the joint conference is to provide a single, high-profile, internationally respected archival forum for scientific research in the theory and practice of autonomous agents and multiagent systems. AAMAS 2008 is the seventh conference in the AAMAS series, following enormously successful previous conferences in Bologna, Italy (2002), Melbourne, Australia (2003), New York, USA (2004), Utrecht, The Netherlands (2005), Hakodate, Japan (2006), and Honolulu, Hawai'i (2007). AAMAS 2008 will be held at the Cascais Miragem, Estoril, Portugal. AAMAS 2008 is presented in cooperation with the ACM and AAAI. The AAMAS conferences are organized by the International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). More information on the foundation may be found at http://www.ifaamas.org/.
The Expressiveness of Concentration Controlled P Systems
Authors: Shankara Narayanan Krishna
Venue: Proceedings of the 7th international conference on Unconventional Computing (2008)

In this paper, we study concentration controlled P systems having catalysts, bi-stable catalysts and mobile catalysts. We show that computational universality can be obtained for pure catalytic P systems using 2 bi-stable catalysts and 1 membrane, improving the known universality result [2]. We also give universality results using catalysts, and mobile catalysts. Further, we identify some subclasses of these which are not computationally complete.
A Path Following Algorithm for Graph Matching
Authors: Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Vert
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

We propose a convex-concave programming approach for the labelled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the graph matching problem as a least-square problem on the set of permutation matrices and relaxing it to two different optimization problems: a quadratic convex and a quadratic concave optimization problem on the set of doubly stochastic matrices. The concave relaxation has the same global minimum as the initial graph matching problem, but the search for its global minimum is aslo a complex combinatorial problem. We therefore construct an approximation of the concave problem solution by following a solution path of the convex-concave problem obtained by linear interpolation of the convex and concave formulations, starting from the convex relaxation. The algorithm is compared with some of the best performing graph matching methods on three datasets: simulated graphs, QAPLib and handwritten chinese characters.
Simulation of micropolar fluid flow in a vertical channel using homotopy-perturbation method
Authors: Habibis Saleh, Ishak Hashim
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

In this paper, a system of boundary-value-problem modelling the free convection of a micropolar fluid in a vertical channel was solved by the homotopy-perturbation method (HPM). The HPM solution obtained by a computer algebra system is compared against the exact solution. The truncated HPM series solution was shown to agree well with the exact solution.
Interval Arithmetic Using SSE-2
Authors: Branimir Lambov
Venue: Reliable Implementation of Real Number Algorithms: Theory and Practice: International Seminar Dagstuhl Castle, Germany, January 8-13, 2006 Revised Papers (2008)

We present an implementation of double precision interval arithmetic using the single-instruction-multiple-data SSE-2 instruction and register set extensions. The implementation is part of a package for exact real arithmetic, which defines the interval arithmetic variation that must be used: incorrect operations such as division by zero cause exceptions and loose evaluation of the operations is in effect. The SSE-2 extensions are suitable for the job, because they can be used to operate on a pair of double precision numbers and include separate rounding mode control and detection of the exceptional conditions. The paper describes the ideas we use to fit interval arithmetic to this set of instructions, shows a performance comparison with other freely available interval arithmetic packages, and discusses possible very simple hardware extensions that can significantly increase the performance of interval arithmetic. 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
Real Life Field Trial over a Pre-mobile WiMAX System with 4th Order Diversity
Authors: Pål Grønsund, Paal Engelstad, Moti Ayoun, Tor Skeie
Venue: Proceedings of the 7th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2007)

Mobile WiMAX is a promising wireless technology approaching market deployment. Much discussion concentrate on whether mobile WiMAX will reach a tipping point and become 4G or not. As a pre-mobile WiMAX system is being delivered, we decided to set up a real life field trial and perform the most important measurements over the system setup. The system was delivered with 4th order diversity. In this paper we analyze physical system performance based on field trial measurements, especially at locations with non line of sight conditions in urban areas. We investigate the gain with 2nd and 4th order base station diversity and derive analytical expressions. The system path loss is plotted and found to approach the Cost-231 Hata model for urban areas. Throughput is also measured and analyzed. Sub-channelization in the uplink points out to be an important feature for enhanced coverage.
epsilon-Support Vector and Large-Scale Data Mining Problems
Authors: Gang Kou, Yi Peng, Yong Shi, Zhengxin Chen
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Data mining and knowledge discovery has made great progress during the last fifteen years. As one of the major tasks of data mining, classification has wide business and scientific applications. Among a variety of proposed methods, mathematical programming based approaches have been proven to be excellent in terms of classification accuracy, robustness, and efficiency. However, there are several difficult issues. Two of these issues are of particular interest of this research. The first issue is that it is challenging to find optimal solution for large-scale dataset in mathematical programming problems due to the computational complexity. The second issue is that many mathematical programming problems require specialized codes or programs such as CPLEX or LINGO. The objective of this study is to propose solutions for these two problems. This paper proposed and applied mathematical programming model to classification problems to address two aspects of data mining algorithm: speed and scalability.
The Security of Elastic Block Ciphers Against Key-Recovery Attacks
Authors: Debra L. Cook Moti Yung, Angelos D. Keromytis
Venue: Proceedings of the 10th international conference on Information Security (2007)

We analyze the security of elastic block ciphers against key-recovery attacks. An elastic version of a fixed-length block cipher is a variable-length block cipher that supports any block size in the range of one to two times the length of the original block. Our method for creating an elastic block cipher involves inserting the round function of the original cipher into a substitution-permutation network. In this paper, we form a polynomial-time reduction between the elastic and original versions of the cipher by exploiting the underlying network structure. We prove that the elastic version of a cipher is secure against a given key-recovery attack if the original cipher is secure against such an attack. Our analysis is based on the general structure of elastic block ciphers (i.e., the network's structure, the composition methods between rounds in the network and the keying methodology) and is independent of the specific cipher.
Near-force-balanced machining by finite element modelling
Authors: P. Sasavat, J. F. Xie, N. Gindy
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

A near force-balanced approach to machining is proposed to reduce the deterioration of part quality during the machining process, by proposing active/passive tools (supports) cutting simultaneously in aligned or offset orientations. Finite Element Modelling is used to prove the feasibility of this idea by considering a hollow cylinder that is fixed at one end to represent a turning process of a workpiece clamped in a chuck. Weakening the material property by scaling the value of Young's modulus is selected as the material removal technique and also to represent the passive tools movement. Experimental validation of this concept in a twin turning machine (CNC) is underway.