ppxscal/embedding_network huggingface dataset:
Improving Legal Ontologies through Semantic Representation of Adjectives
Authors: Anderson Bertoldi, Rove Chishman
Venue: Proceedings of the International Conference on Semantic Computing (2007)

The research reported here results from a master's thesis project developed in the scope of SEMANTEC, DIRPI and LOIS projects. The aim of our research was to show what kind of semantic information was carried by adjectives and how this information could improve legal ontologies and legal information retrieval. In this paper we will discuss the main results related to the development of this research. We combine different linguistic theories to approach adjectival semantics. As result of this research, we propose five different adjectival groups. Each group has a specific semantic behavior and can contribute in different ways to legal information retrieval.
Spam Filtering With Dynamically Updated URL Statistics
Authors: Jangbok Kim, Kihyun Chung, Kyunghee Choi
Venue: IEEE Security and Privacy (2007)

Many URL-based spam filters rely on "white" and "black" lists to classify email. The authors' proposed URL-based spam filter instead analyzes URL statistics to dynamically calculate the probabilities of whether email with specific URLs are spam or legitimate, and then classifies them accordingly.
WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
Authors: Dominique Geniet, Gaëlle Largeteau
Venue: Theoretical Computer Science (2007)

This paper presents the initial step of an aid design method earmarked for operational validation of hard real-time systems. We consider systems that are composed of sequential hard real-time tasks, which are embedded on centralized multiprocessor architectures. We introduce a model based upon untimed finite automata and meant to collect the operational behaviors of the system compatible with its time specifications, and we go on to provide a feasibility decision result for systems composed of tasks presenting CPU loads which are exact values: execution times are not WCET values. This is why we call this approach WCET-free analysis. The results we have achieved likewise involve hardware specifications such as multiprocessors and speeds of processors.
Undecidability of bisimilarity by defender's forcing
Authors: Petr Jančar, Jivří Srba
Venue: Journal of the ACM (JACM) (2008)

Stirling &lsqb;1996, 1998&rsqb; proved the decidability of bisimilarity on so-called normed pushdown processes. This result was substantially extended by S&eacute;nizergues &lsqb;1998, 2005&rsqb; who showed the decidability of bisimilarity for regular (or equational) graphs of finite out-degree; this essentially coincides with weak bisimilarity of processes generated by (unnormed) pushdown automata where the &epsiv;-transitions can only deterministically pop the stack. The question of decidability of bisimilarity for the more general class of so called Type -1 systems, which is equivalent to weak bisimilarity on unrestricted &epsiv;-popping pushdown processes, was left open. This was repeatedly indicated by both Stirling and S&eacute;nizergues. Here we answer the question negatively, that is, we show the undecidability of bisimilarity on Type -1 systems, even in the normed case. We achieve the result by applying a technique we call Defender's Forcing, referring to the bisimulation games. The idea is simple, yet powerful. We demonstrate its versatility by deriving further results in a uniform way. First, we classify several versions of the undecidable problems for prefix rewrite systems (or pushdown automata) as &Pi;01-complete or &Sigma;11-complete. Second, we solve the decidability question for weak bisimilarity on PA (Process Algebra) processes, showing that the problem is undecidable and even &Sigma;11-complete. Third, we show &Sigma;11-completeness of weak bisimilarity for so-called parallel pushdown (or multiset) automata, a subclass of (labeled, place/transition) Petri nets.
A Constrained Fuzzy Arithmetic Method for the Fuzzy Analytic Network Process
Authors: Jih-Jeng Huang, Gwo-Hshiung Tzeng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

In this paper, we extend the analytic network process (ANP) by using fuzzy judgments to resolve the problem of uncertainty. Instead of providing crisp global weights, the proposed method, called the fuzzy analytic network process (FANP), provides both fuzzy local weights and fuzzy global weights. The method can help decision- makers understand the uncertainty degree of a problem before making the final decision.
A Serial Logarithmic Number System ALU
Authors: Mark G. Arnold, Panagiotis D. Vouzis
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Serial arithmetic uses less hardware than parallel arithmetic. Serial floating point (FP) is slower than parallel FP. The Logarithmic Number System (LNS) simplifies operations, but a fast serial implementation of LNS has never been proposed previously. This paper presents a fast bitserial LNS that combines a novel serial implementation of Mitchell's method and a new error correction method that is compatible with least-significant-bit-first serial arithmetic. Keywords: Serial Arithmetic, Logarithmic Number System.
An Efficient Expression on Cartoon Rendering Scheme in Game Characters
Authors: Jong Seo Kim, Kang Soo You, Hoon Sung Kwak
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

The traditional cell-animations are expressed mostly by silhouette edges and inner shadings. Expressing cell-animations by digital techniques is cartoon rendering. Rendering techniques are divided into photorealistic rendering technique and non-photorealistic rendering technique. Cartoon rendering is non-photorealistic rendering technique and used in movies, advertisements and games etc. This paper examines game characters among contents using cartoon renderings. And this paper investigates features and effects of cartoon rendering techniques used in each game. Based on those considerations, this paper proposes new cartoon rendering technique.
Generating Copybooks from Consistent Handwriting Styles
Authors: R. Niels, L. Vuurpijl
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

The automatic extraction of handwriting styles is an im- portant process that can be used for various applications in the processing of handwriting. We propose a novel method that employs hierarchical clustering to explore prominent clusters of handwriting. So-called membership vectors are introduced to describe the handwriting of a writer. Each membership vector reveals the frequency of occurrence of prototypical characters in a writer's handwriting. By clustering these vectors, consistent handwriting styles can be extracted, similar to the exemplar handwritings docu- mented in copybooks. The results presented here are chal- lenging. The most prominent handwriting styles detected correspond to the broad style categories cursive, mixed, and print.
A hybrid approach for off-line Arabic handwriting recognition based on a Planar Hidden Markov modeling
Authors: Sameh Masmoudi Touj, Najoua Essoukri Ben Amara, Hamid Amiri
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

A novel approach for the Arabic handwriting recognition is presented. The use of a Planar Hidden Markov Model (PHMM) has permitted to split the Arabic script into five homogeneous horizontal regions. Each region was described by a 1D-HMM. This modeling is based on different levels of segmentation: horizontal, natural and vertical. Both holistic and analytical approaches have been tested for the description of the median band of the Arabic writing. We show finally that a hybrid approach conducted to the improvement of the whole system performances.
IndeGS: index supported graphics data server for CFD data postprocessing
Authors: Christoph Brochhaus, Thomas Seidl
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Virtual reality techniques particularly in the field of CFD (computational fluid dynamics) are of growing importance due to their ability to offer comfortable means to interactively explore 3D data sets. The growing accuracy of the simulations brings modern main memory based visualization frameworks to their limits, inducing a limitation on CFD data sizes and an increase in query response times, which are obliged to be very low for efficient interactive exploration. We therefore developed "IndeGS", the index supported graphics data server, to offer efficient dynamic view dependent query processing on secondary storage indexes organized by "IndeGS" offering a high degree of interactivity and mobility in VR environments in the context of CFD postprocessing on arbitrarily sized data sets. Our demonstration setup presents "IndeGS" as an independent network component which can be addressed by arbitrary VR visualization hardware ranging from complex setups (e.g. CAVE, HoloBench) over standard PCs to mobile devices (e.g. PDAs). Our demonstration includes a 2D visualization prototype and a comfortable user interface to simulate view dependent CFD postprocessing performed by an interactive user freely roaming a fully immersive VR environment. Hereby, the effects of the use of different distance functions and query strategies integrated into "IndeGS" are visualized in a comprehensible way.
Optimal Sorting Algorithms for Parallel Computers
Authors: G. Baudet
Venue: IEEE Transactions on Computers (1978)

The problem of sorting a sequence of n elements on a parallel computer with k processors is considered. The algorithms we present can all be run on a single instruction stream multiple data stream computer. For large n, each achieves an asymptotic speed-up ratio of k with respect to the best sequential algorithm, which is optimal in the number of processors used.
Mochizuki's crys-stable bundles: a lexicon and applications
Authors: Brian Osserman
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

Mochizuki's work on torally crys-stable bundles [18] has extensive implications for the theory of logarithmic connections on vector bundles of rank 2 on curves, once the language is translated appropriately. We describe how to carry out this translation, and give two classes of applications: first, one can conclude almost immediately certain results classifying Frobenius-unstable vector bundles on curves; and second, it follows from the results of [22] that one also obtains results on rational functions with prescribed ramification in positive characteristic.
Approximations in n-ary algebraic systems
Authors: B. Davvaz
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

Algebraic systems have many applications in the theory of sequential machines, formal languages, computer arithmetics, design of fast adders and error-correcting codes. The theory of rough sets has emerged as another major mathematical approach for managing uncertainty that arises from inexact, noisy, or incomplete information. This paper is devoted to the discussion of the relationship between algebraic systems, rough sets and fuzzy rough set models. We shall restrict ourselves to algebraic systems with one n-ary operation and we investigate some properties of approximations of n-ary semigroups. We introduce the notion of rough system in an n-ary semigroup. Fuzzy sets, a generalization of classical sets, are considered as mathematical tools to model the vagueness present in rough systems.
Web-based education system for elementary mathematics
Authors: Yoshifumi Okuyama, Taizou Nagahama, Miki Kitamura
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Elementary mathematics, for instance, algebraic equations is an important field of study in higher education. In particular, graphical representations of curves of equations make the understanding of mathematical problem easy for students. Therefore, we have developed a web-based education system with a graphics database for elementary mathematics, particularly, algebraic equations. In this paper, the analytical properties of quadratic and cubic algebraic equations are discussed on the basis of the Sturm concept because of its educational value and usefulness in analyzing and designing a real system. Some graphical representations utilized for the web-based education system of algebraic equations are shown. An intranet e-learning system constructed in our laboratory on a Linux web-server (Apache HTTP server) is presented.
Content-based Image Authentication: Current Status, Issues, and Challenges
Authors: Shuihua Han, Chao-Hsien Chu, Shuangyuan Yang
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Digital image manipulation software is readily accessible from the Internet today, thus, digital data is very easy to be tampered without having any clue. Under this circumstance, integrity verification has become an important issue in the digital world. The aim of this paper is to present an in-depth analysis on the methods of detecting image tampering. We introduce the notion of image content authentication and the features required to design an effective authentication scheme. We review some algorithms and frequently used security mechanisms. We also analyze and discuss the performance trade-offs and related security issues among existing technologies. Compared with those techniques and protocols based on digital signatures or watermarking, majority of the proposed image hash methods emphasize more on content authentication rather than strict integrity.
Distributed Software System Design Representation Using Modified Petri Nets
Authors: S. S. Yau
Venue: IEEE Transactions on Software Engineering (1983)

A model for representing and analyzing the design of a distributed software system is presented. The model is based on a modified form of Petri net, and enables one to represent both the structure and the behavior of a distributed software system at a desired level of design. Behavioral properties of the design representation can be verified by translating the modified Petri net into an equivalent ordinary Petri net and then analyzing that resulting Petri net. The model emphasizes the unified representation of control and data flows, partially ordered software components, hierarchical component structure, abstract data types, data objects, local control, and distributed system state. At any design level, the distributed software system is viewed as a collection of software components. Software components are externally described in terms of their input and output control states, abstract data types, data objects, and a set of control and data transfer specifications. They are interconnected through the shared control states and through the shared data objects. A system component can be viewed internally as a collection of subcomponents, local control states, local abstract data types, and local data objects.
Extraction of Arabic Words from Complex Color Image
Authors: R. Fathalla, Y. El Sonbaty, M. Ismail
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Words have always been important carriers of information. They convey a lot of aspects about images in which they are embedded. In spite of the many approaches that have been proposed to separate text from images, very few of them have handled Arabic script. This paper presents a technique to extract Arabic words from a variety of colored images with complex backgrounds. In order to accomplish the task we have chosen the Connected Components (CC) approach. It starts with the breakdown of the RGB image into tiny homogeneous regions using the watershed transform, followed by region merging. The resulting CCs are aggregated into blocks, some of which are the candidate words. Each block is then condensed into a single vector holding the values of its features. The features generally describe the geometrical nature of the Arabic script, including a set of invariant moments. The final decision as to classify the blocks as Arabic words or other was left up to a support vector machine (SVM) before passing them to an OCR software.
Proofs and pedagogy; science and systems: The grammar tool box
Authors: Adrian Johnstone, Elizabeth Scott
Venue: Science of Computer Programming (2007)

GTB (the Grammar Tool Box) is the tool that underpins our investigations into generalised parsing. Our goal is to produce a system that supports systematic investigation of various styles of generalised parsing in a way that allows meaningful comparisons between them in a repeatable and easily accessible fashion whilst also allowing: (i) new theoretical ideas to be generated and explored; (ii) production quality parsers to be generated and (iii) humane pedagogy. GTB comprises a language (LC) with various kinds of built-in grammar and automata related objects, and a set of black-box methods written in C++ that provide implementations of grammar transforms, automata construction algorithms, parsing and recognition algorithms, and a variety of visualisation aids. In this paper we focus on the overall rationale for the GTB framework; the GTB design goals; and some detailed operational flows that are supported by GTB.
Register Transfer Level Concurrent Error Detection in Elliptic Curve Crypto Implementations
Authors: Richard Stern, Nikhil Joshi, Kaijie Wu, Ramesh Karri
Venue: Proceedings of the Workshop on Fault Diagnosis and Tolerance in Cryptography (2007)

In this paper we present an Register Transfer Level (RTL) Concurrent Error Detection (CED) technique targeting hardware implementations of Elliptic Curve Cryptography (ECC). The proposed mixed hardware and time-redundancy based CED techniques use the mathematical properties of the underlying Galois Field as well as the ECC primitives to detect both soft errors and permanent faults with low area overhead. Results for sequential implementations of GF multiplication and inverse operations yielded an area overhead of 30% and a time overhead of 120%.
Flow-slice: a novel load-balancing scheme for multi-path switching systems
Authors: Lei Shi, Bin Liu, Changhua Sun, Zhengyu Yin, Laxmi Bhuyan, H. Jonathan Chao
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

Multi-Path Switching systems (MPS) are intensively used in the state-of-the-art core routers. One of the most intractable issues is how to load-balance traffic across its multiple paths while not disturbing the intra-flow packet orders. In this paper, based on the studies of tens of real Internet traces, we develop a novel scheme, namely Flow-Slice (FS), which cuts off each flow into flow-slices at every intra-flow interval larger than a slicing threshold set to 1ms 4ms and balances the load on the finer granularity. Through theoretical analyses and comprehensive trace-driven simulations, we show that FS achieves impressive load-balancing performance with little hardware cost while limiting the packet out-of-order chances to a negligible level (below 10 -6).
Appearance preserving octree-textures
Authors: Julien Lacoste, Tamy Boubekeur, Bruno Jobard, Christophe Schlick
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

Because of their geometric complexity, high resolution 3D models, either designed in high-end modeling packages or acquired with range scanning devices, cannot be directly used in applications that require rendering at interactive framerates. One clever method to overcome this limitation is to perform an appearance preserving geometry simplification, by replacing the original model with a low resolution mesh equipped with high resolution normal maps. This process visually preserves small scale features from the initial geometry, while only requiring a reduced set of polygons. However, this conversion usually relies on some kind of global or piecewise parameterization, combined with the generation of a texture atlas, a process that is computationally expensive and requires precise user supervision. In this paper, we propose an alternative method in which the normal field of a high resolution model is adaptively sampled and encoded in an octree-based data structure, that we call appearance preserving octree-texture (APO). Our main contributions are: a normal-driven octree generation, a compact encoding and an efficient look-up algorithm. Our method is efficient, totally automatic, and avoids the expensive creation of a parameterization with its corresponding texture atlas.
Empirical investigation of the benefits of partial lamarckianism
Authors: Christopher R. Houck, Jeffery A. Joines, Michael G. Kay, James R. Wilson
Venue: Evolutionary Computation (1997)

Genetic algorithms (GAs) are very efficient at exploring the entire search space; however, they are relatively poor at finding the precise local optimal solution in the region in which the algorithm converges. Hybrid GAs are the combination of improvement procedures, which are good at finding local optima, and GAs. There are two basic strategies for using hybrid GAs. In the first, Lamarckian learning, the genetic representation is updated to match the solution found by the improvement procedure. In the second, Baldwinian learning, improvement procedures are used to change the fitness landscape, but the solution that is found is not encoded back into the genetic string. This paper examines the issue of using partial Lamarckianism (i.e., the updating of the genetic representation for only a percentage of the individuals), as compared to pure Lamarckian and pure Baldwinian learning in hybrid GAs. Multiple instances of five bounded nonlinear problems, the location-allocation problem, and the cell formation problem were used as test problems in an empirical investigation. Neither a pure Lamarckian nor a pure Baldwinian search strategy was found to consistently lead to quicker convergence of the GA to the best known solution for the series of test problems. Based on a minimax criterion (i.e., minimizing the worst case performance across all test problem instances), the 20% and 40% partial Lamarckianism search strategies yielded the best mixture of solution quality and computational efficiency.
A Hardware Algol Machine
Authors: Nagi Abo El Naga, James Field
Venue: IEEE Micro (1982)

This direct-execution machine runs programs faster, and at no higher cost, than a conventional system of equivalent capacity.
New Algorithms for the Approximate Evaluation in Hardware of Binary Logarithms and Elementary Functions
Authors: D. Marino
Venue: IEEE Transactions on Computers (1972)

After an analysis of the errors introduced in the approximate computation of the x2function (O = x = 1) and its distributions, we find that a parabolic rather than linear fit to log2 (1 + x), (O = x = 1) can be performed in hardware without increasing the number of necessary sums. An improvement, by a factor of about 2.5, in the absolute maximum error can be expected. Full simulation on
Kongsberg's Road to an Industrial Software Methodology
Authors: J. T. Pederson
Venue: IEEE Transactions on Software Engineering (1978)

Kongsberg Våpenfabrikk, Norway, has been engaged in establishing an up-to-date software engineering facility since late 1976.