ppxscal/embedding_network huggingface dataset:
Time and Frequency Approaches to Non Destructive Testing in Concrete Pillars Using Neural Networks
Authors: Barbara Cannas, Sara Carcangiu, Francesca Cau, Alessandra Fanni, Augusto Montisci
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

In this paper, Multi Layer Perceptron neural networks have been trained to identify the position of defects in concrete structures analyzed using an ultrasound technique. A diagnostic model obtained by means of Finite Elements techniques has been used to model the ultrasound transmission through a concrete pillar of specified size affected by defects in different positions. The obtained signals have been processed both in the time and frequency domains, in order to reduce data dimensionality and to compute suitable features. Results show good accuracy in the identification of the position of the faults.
Agent based approach for distribution of fingerprint matching in a metacomputing environment
Authors: Kadda Beghdad Bey, Zahia Guessoum, Aicha Mokhtari, Farid Benhammadi
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

Fingerprint matching is one of the most important problems in an Automatic Fingerprint Identification System. The Fingerprint matching is a high computational task, repetitive and arduous. Moreover, fingerprint databases are by nature large scale. Indeed, there is a need for flexible and independent solution for automatic distribution of fingerprint matching. So, this paper introduces an agent-based distributed matching system. The matching task distributed on a available local Network resources with an optimal way in order to ensure a fast matching process in large scale fingerprint databases. The distribution workload is ensured by our developed middleware allowing the monitoring and prediction of unexploited network computing resources, and designed for the implementation of intensive calculation services.
PACTOLE: A Methodology and a System for Semi-automatically Enriching an Ontology from a Collection of Texts
Authors: Rokia Bendaoud, Yannick Toussaint, Amedeo Napoli
Venue: Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning (2008)

PACTOLE stands for "Property And Class characterization from Text for OntoLogy Enrichment" and is a semi-automatic methodology for enriching an initial ontology from a collection of texts in a given domain. PACTOLE is also the name of the associated system relying on Formal Concept Analysis (FCA). In this way, PACTOLE is able to derive a concept lattice from a formal context, consisting of a binary table describing a set of individuals with their properties. Given a domain ontology and a set of objects with their properties (extracted from a collection of texts), the PACTOLE system builds two concept lattices: the first corresponding to the restriction of the ontology schema to the considered objects and the second to the extracted pairs (object, property). As they are based on the same set of individuals, the two ontologies are merged using context apposition. The resulting final concept lattice is analyzed and a number of knowledge units can be extracted and furthermore used for enriching the initial ontology. Finally, the final concept lattice is mapped within the ${\cal FLE}$ KR formalism. The paper introduces and explains in details the PACTOLE methodology with the help of an example in the domain of astronomy.
System-level optimizations for high performance dsm circuits
Authors: Hai Zhou
Venue:  (2008)

Process scaling has enabled the production of integrated circuits with millions of transistors. System-on-a-Chip becomes feasible as more functionalities can be packed into a single chip. As the human brain power is limited, the design process of such sophisticated systems should be automated in order to meet the stringent design specifications and short time-to-market. On one hand, ever-increasing system sizes require scalable algorithms for efficient system design space exploration. On the other hand, shrinking VLSI feature sizes require previous ignored physical effects to be considered for the reliability and manufacturability of the system. In this dissertation, we will present a few essential advances in design automation of high performance DSM circuits for the above challenges. We investigate floorplanning techniques in order to address the methodology shift from logic centric to interconnect centric. We propose the processing rate as an unified performance measure and develop a floorplanning approach to optimize it directly through efficient minimum cycle ratio algorithms. Then, we present two graph-based floorplan approaches&mdash;one of them models the adjacency relations between the non-overlapping rectangular blocks, and the other models the non-overlapping constraints between the blocks, while the sizes of both graphs are linear in terms of the number of the blocks. Moreover, we investigate sequential system optimization techniques for system optimizations under performance bounds. We propose to combine sizing and clock skew optimization in a convex-programming-based framework and design an algorithm to solve the problem based on the method of feasible directions and min-cost network flow. We then present an optimal minimum area retiming algorithm that incrementally relocates flip-flops in a sequential circuit without changing its functionality subject to a clock period bound. Compared to the conventional algorithms that solve the same problem, our algorithm only requires linear storage and is practically much more efficient. Further more, we investigate design for manufacturability techniques to consider issues in chip fabrication at the design time. We propose to perform risk-aversion min-period retiming in order to overcome process variations through retiming and present a heuristic incremental retiming algorithm. We study the antenna effect during fabrication process that damages gates and design an optimal algorithm in routing stage to insert jumpers under a bound of antenna ratio such that the damages of antenna effects will be limited.
A sixth order accurate AGE iterative method for non-linear singular two point boundary value problems
Authors: R. K. Mohanty, D. J. Evans, Navnit Jha
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

We report alternating group explicit (AGE) iteration method to solve the tri-diagonal linear system derived from a new finite difference discretization of sixth order accuracy of the two point singular boundary value problem $u"&plus;\frac{&alpha;}{r}u'=f(r)$, 0 < r < 1, &alpha; =1 and 2 subject to boundary conditions u(0)=A, u(1)=B, where A and B are finite constants. We also discuss Newton-AGE iteration method for the sixth order numerical solution of two point non-linear boundary value problem. The proof for the convergence of the AGE iteration method when the coefficient matrix is real and unsymmetric is discussed. Numerical results are presented to illustrate the proposed iterative methods.
A Study on Performance Evaluation of the Asymmetric Turbo Codes
Authors: Byoung-Sup Shim, Seok-Jun Choi, Hyoung-Keun Park, Sun-Youb Kim, Yu-Chan Ra
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

It is well known the fact that the turbo codes has better performance as the number of iterations and the interleaver size increase in an AWGN channel environment. However, if the number of iterations and the interleaver size are increased, it is required much delay and computation for an iterative decoding. And it is caused the flattening effect phenomenon which is very little BER performance improvement at the arbitrary SNR. This paper proposes the new asymmetric turbo codes, which is consisted of the parallel concatenated turbo codes, that uses the mixed types of the component codes with different not only the constraint length but also the generator polynomial. It analyzes the BER performance for the log-MAP decoding algorithm with the frame sizes of 128, 256, 512 and 1024 bits, and the coding rate of 1/3. The simulation result shows that the BER performance of the proposal asymmetric turbo codes is superior to the conventional symmetric turbo codes. It can be also observed that the flattening effect phenomenon is very reduced by applying the proposal asymmetric turbo codes.
Determination of the source parameter in a heat equation with a non-local boundary condition
Authors: Daoud S. Daoud
Venue: Journal of Computational and Applied Mathematics (2008)

In this article we consider the inverse problem of identifying a time dependent unknown coefficient in a parabolic problem subject to initial and non-local boundary conditions along with an overspecified condition defined at a specific point in the spatial domain. Due to the non-local boundary condition, the system of linear equations resulting from the backward Euler approximation have a coefficient matrix that is a quasi-tridiagonal matrix. We consider an efficient method for solving the linear system and the predictor-corrector method for calculating the solution and updating the estimate of the unknown coefficient. Two model problems are solved to demonstrate the performance of the methods.
Micro assembly injection moulding with plasma treated inserts
Authors: W. Michaeli, T. Kamps
Venue: Microsystem Technologies (2008)

Injection moulding is one of the most common manufacturing processes for thermoplastics. By injection moulding, polymer micro components can be produced in large numbers at low costs. Micro assembly injection moulding as a combination of multi-component injection moulding and micro injection moulding enables to avoid offline process steps, as joining is already accomplished in the mould by overmoulding. In case of joint hybrid micro structures, the bonding strength between two components affects the stability of the micro system and is thus important for the part quality. Investigations carried out at the Institute of Plastics Processing (IKV), Aachen, Germany, deal with methods to increase the bonding strength of a plastic and a non-plastic part joint. As shown in the following, a plasma treatment of the inserts is an appropriate approach for this aim.
Delay Modelling at Unsignalized Highway Nodes with Radial Basis Function Neural Networks
Authors: Hilmi Berk Celikoglu, Mauro Dell'Orco
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

In vehicular traffic modelling, the effect of link capacity on travel times is generally specified through a delay function. In this paper, the Radial Basis Function Neural Network (RBFNN) method, integrated into a dynamic network loading process, is utilized to model delays at a highway node. The results of the model structure have then been compared to evaluate the relative performance of the integrated neural network method.
Real time data consistency in component based embedded systems
Authors: Nadège Pontisso, Gérard Padiou, Philippe Quéinnec
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

Embedded systems use more and more distributed architectures. For example, several instrumentation components communicate with a calculator via a field bus. Such distributed systems need to be sufficiently deterministic despite the asynchronous characteristics of their hardware components. This work fits in with these problematics and focuses on the control of the temporal compatibility of a set of interdependent data used by the components of the system. Indeed, even if the components keep a simple behaviour, periodic for example, latencies in computation and communication can cause inconsistencies during the use of these data. The study focuses on the data consistency formalisation by defining a relation called influence. The data flow between components is abstracted to a graph and, from the definition of particular subgraphs called spindles, a data timestamping rule is elaborated. It permits to define consistency constraints using constraints on these timestamps.
Doppler Keystone Transform for SAR Imaging of Moving Targets
Authors: Gang Li, Xiang-Gen Xia, Ying-Ning Peng
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

A synthetic aperture radar (SAR) data reformatting approach named Doppler Keystone transform (DKT) is proposed to correct the range migration of the moving target. By combining the DKT and the Doppler phase compensation methods, the moving target can be well imaged in high signal-clutter-ratio (SCR) case. Moreover, the DKT-based algorithm is suitable for parallel implementation.
Powerful Change Part 1: Batteries and Possible Alternatives for the Mobile Market
Authors: Thad E. Starner
Venue: IEEE Pervasive Computing (2003)

Power is a difficult issue and is often overlooked in mobile computers. However, innovative opportunities abound for exploring this problem. This installment covers this issue and proposes some alternatives to batteries for wearable computers.
Automatic Topological Active Net Division in a Genetic-Greedy Hybrid Approach
Authors: N. Barreira, M. G. Penedo, O. Ibáñez, J. Santos
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

In this paper we propose an automatic division procedure for the Topological Active Net model in a hybrid combination of a genetic and a greedy algorithm. This procedure allows the division of the active net in subnets with the aim of segmenting several objects in the same image. The combination of the greedy algorithm and the global search improves the results in both synthetic and real images.
An Intelligent Traveling Service Based on SOA
Authors: Samaneh Navabpour, Laleh Soltan Ghoraie, Ali Akhavan Malayeri, Jingxi Chen, Jianguo Lu
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

This paper describes the implementation of a mashup that integrates travel services. There are various travel services focusing on flight, train, or bus. However, none of them can plan a best trip utilizing all of those travel methods due to the lack of centralized data provided by different organizations. Using service oriented architecture; we first construct the service wrappers for various travel services. Given a travel request from end user, our system can decompose the user query into subqueries and send those subqueries to primitive services in order to find the best way of traveling. The shortest path algorithm is used to find the cheapest price via the combination of flight, train, and bus.
Using the web as an implicit training set: application to noun compound syntax and semantics
Authors: Marti Hearst, Dan Klein
Venue:  (2007)

An important characteristic of English written text is the abundance of noun compounds&mdash;sequences of nouns acting as a single noun, e.g., colon cancer tumor suppressor protein. While eventually mastered by domain experts, their interpretation poses a major challenge for automated analysis. Understanding noun compounds' syntax and semantics is important for many natural language applications, including question answering, machine translation, information retrieval, and information extraction. For example, a question answering system might need to know whether 'protein acting as a tumor suppressor' is an acceptable paraphrase of the noun compound tumor suppressor protein, and an information extraction system might need to decide if the terms neck vein thrombosis and neck thrombosis can possibly co-refer when used in the same document. Similarly, a phrase-based machine translation system facing the unknown phrase WTO Geneva headquarters, could benefit from being able to paraphrase it as Geneva headquarters of the WTO or WTO headquarters located in Geneva. Given a query like migraine treatment , an information retrieval system could use paraphrasing verbs like relieve and prevent for page ranking and query refinement. I address the problem of noun compounds syntax by means of novel, highly accurate unsupervised and lightly supervised algorithms using the Web as a corpus and search engines as interfaces to that corpus. Traditionally the Web has been viewed as a source of page hit counts, used as an estimate for n-gram word frequencies. I extend this approach by introducing novel surface features and paraphrases, which yield state-of-the-art results for the task of noun compound bracketing. I also show how these kinds of features can be applied to other structural ambiguity problems, like prepositional phrase attachment and noun phrase coordination. I address noun compound semantics by automatically generating paraphrasing verbs and prepositions that make explicit the hidden semantic relations between the nouns in a noun compound. I also demonstrate how these paraphrasing verbs can be used to solve various relational similarity problems, and how paraphrasing noun compounds can improve machine translation.
Soft clustering using weighted one-class support vector machines
Authors: Manuele Bicego, Mario A. T. Figueiredo
Venue: Pattern Recognition (2009)

This paper describes a new soft clustering algorithm in which each cluster is modelled by a one-class support vector machine (OC-SVM). The proposed algorithm extends a previously proposed hard clustering algorithm, also based on OC-SVM representation of clusters. The key building block of our method is the weighted OC-SVM (WOC-SVM), a novel tool introduced in this paper, based on which an expectation-maximization-type soft clustering algorithm is defined. A deterministic annealing version of the algorithm is also introduced, and shown to improve the robustness with respect to initialization. Experimental results show that the proposed soft clustering algorithm outperforms its hard clustering counterpart, namely in terms of robustness with respect to initialization, as well as several other state-of-the-art methods.
Spatial Information Retrieval from Images Using Ontologies and Semantic Maps
Authors: Stavros Christodoulakis, Michalis Foukarakis, Lemonia Ragia
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

Cameras provide integrated GPS technology which makes them a powerful sensor for geographical context related images. They allow wireless connection to computers and the images can be automatically transferred to a PC or can be integrated into a GIS system. In this paper we propose an approach for spatial information retrieval from images using the concept of ontologies and semantic maps. The term of ontology is used in our case to describe spatial domain knowledge to enhance the search capability and image annotation. The objects are represented by their location in semantic maps. We describe a developed prototype system with a database design for ontologies and semantic maps. We demonstrate the automatic image annotation and the visualization of the spatial queries. The system is oriented to the area of culture and tourism and provides a user friendly interface.
Knowledge versus learning in internationalization of offshoring activities in China: A case study
Authors: Poul Houman Andersen
Venue: Journal of Engineering and Technology Management (2008)

This paper deals with the role of existing knowledge in the learning process of the internationalizing organisation. Using an organisational routine approach to organisational knowledge, the paper explores the dual role of pre-existing knowledge in internationalisation. Organisational learning is guided by pre-existing knowledge but is also providing a hindrance to further knowledge development. Experiential learning may challenge existing assumptions in the firm which trigger organisational resistance. The empirical context of the study consists of two in-depth case studies of offshoring activities in China.
Numerical methods on graded meshes for singular integral equations with conjugation
Authors: V. Didenko, G. Pittaluga, L. Sacripante, E. Venturino
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

In this paper we consider simple methods for the numerical solution of Cauchy singular integral equations with conjugation based on quadratures. They use collocation at a set of nodes which is graded toward the endpoints, to accomodate for the presence of the singularity. Our numerical experience reveals that the theoretical stability findings are indeed of practical applicability, as the empirical condition number is seen very often to reach a plateau, whose asymptotic value is indeed very low.
Pattern Matching Techniques to Identify Syntactic Variations of Tags in Folksonomies
Authors: Francisco Echarte, Jose Javier Astrain, Alberto Córdoba, Jesus Villadangos
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

Folksonomies offer an easy method to organize information in the current Web. This fact and their collaborative features have derived in an extensive involvement in many Social Web projects. However they present important drawbacks regarding their limited exploring and searching capabilities, in contrast with other methods as taxonomies, thesauruses and ontologies. One of these drawbacks is an effect of its flexibility for tagging, producing frequently multiple syntactic variations of a same tag. In this paper we study the application of two classical pattern matching techniques, Levenshtein distance for the imperfect string matching and Hamming distance for the perfect string matching, to identify syntactic variations of tags.
Modeling Highway Traffic Volumes
Authors: Tomáš Šingliar, Miloš Hauskrecht
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

Most traffic management and optimization tasks, such as accident detection or optimal vehicle routing, require an ability to adequately model, reason about and predict irregular and stochastic behavior. Our goal is to create a probabilistic model of traffic flows on highway networks that is realistic from the point of applications and at the same time supports efficient learning and inference. We study several multivariate probabilistic models and analyze their respective strengths. To balance accuracy and efficiency, we propose a novel learning model, mixture of Gaussian trees, and show its advantages in learning and inference. All models are evaluated on real-world traffic flow data from highways of the Pittsburgh area.
A Survey of Formal Verification for Business Process Modeling
Authors: Shoichi Morimoto
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Information systems have to respond well to the changing business environment. Thus, they must have architecture which withstands the change. To design such systems, business process modeling is effective, however, the models include often abstractness and arbitrariness. Therefore, there have been efforts that validate rigorousness of the models. They have defined semantics of the models and applied various logics and formal methods to verification of the rigorousness. This paper focuses on formal verification of the models and surveys the efforts. We also discuss the prospect of the solutions. The establishment of the verification will be surely helpful toward solving the problems on business process reengineering, business process management, service-oriented architecture, and so on.