ppxscal/embedding_network huggingface dataset:
Ontological considerations of time, meta-predicates and temporal propositions
Authors: Jixin Ma
Venue: Applied Ontology (2007)

A natural approach to representing and reasoning about temporal propositions (i.e., statements with time-dependent truth-values) is to associate them with time elements. In the literature, there are three choices regarding the primitive for the ontology of time: (1) instantaneous points, (2) durative intervals and (3) both points and intervals. Problems may arise when one conflates different views of temporal structure and questions whether some certain types of temporal propositions can be validly and meaningfully associated with different time elements. In this paper, we shall summarize an ontological glossary with respect to time elements, and diversify a wider range of meta-predicates for ascribing temporal propositions to time elements. Based on these, we shall also devise a versatile categorization of temporal propositions, which can subsume those representative categories proposed in the literature, including that of Vendler, of McDermott, of Allen, of Shoham, of Galton and of Terenziani and Torasso. It is demonstrated that the new categorization of propositions, together with the proposed range of meta-predicates, provides the expressive power for modeling some typical temporal terms/phenomena, such as starting-instant, stopping-instant, dividing-instant, instigation, termination and intermingling etc.
Innovative Methodology for IR Acquisition
Authors: G. Acciani, A. Camposarcone, S. Vergura
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

This paper propose an innovative and cheap methodology to guarantee a uniform heating of the sample under examination before an IR acquisition. The comparison with the standard heating confirms the goodness of the approach. Moreover, this paper proposes an algorithm for the processing of the IR images, able to detect the weft of the wall. The overall procedure can be also utilized for the defect diagnosis.
Distributed Preservation Services: Integrating Planning and Actions
Authors: Christoph Becker, Miguel Ferreira, Michael Kraxner, Andreas Rauber, Ana Alice Baptista, José Carlos Ramalho
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

Digital preservation has turned into an active field of research. The most prominent approaches today are migration and emulation; especially considering migration, a range of working tools is available, each with specific strengths and weaknesses. The decision process on which actions to take to preserve a given set of digital objects for future access, i.e., preservation planning, is usually an ad-hoc procedure with little tool support and even less support for automation.This paper presents the integration of tools and services for object migration and characterization through a service oriented architecture into a planning tool called Plato, thus creating a distributed and highly automated preservation planning environment.
Automated Positioning of Overlapping Eye Fundus Images
Authors: Povilas Treigys, Gintautas Dzemyda, Valerijus Barzdziukas
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Changes in eye fundus images can be associated with numerous vision threatening diseases such as glaucoma, optic neuropathy, swelling of the optic nerve head, or related to some systemic disease. Tracking the progress of a possible disease of the patient becomes very difficult from separated retinal images. In this article we present a method which registers two retinal images so that the fundus images overlaps each other in the best way. As a separate case, this article shows that in order to solve the optic nerve disc registration problem a linear transformation of retinal image is sufficient. A human identification possibility via retinal image registration will be disclosed as well.
Searching for a Cryptographic Model Based on the Pre-Image Calculus of Cellular Automata
Authors: Heverton B. Macêdo, Marcelo J. L. Lima, Gina M. B. Oliveira
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

Several cryptographic models based on cellular automata (CA) have been investigated in the literature. The parallel processing nature of CA is one of the major motivations to study them as fast ciphering and deciphering algorithms. This paper investigates the viability of using the reverse algorithm that performs pre-image calculus as a cipher method. Therefore, in the approach investigated here the ciphering process is accomplished by interacting CA lattice backward. This idea is similar to Gutowitz´s model in which a kind of pre-image calculus is used to cipher the plaintext, while the CA is interacted forward to recover the original lattice starting from the ciphertext. In this previous model the ciphertext increases as the CA interacts backward. Here we are interested to use the reverse algorithm because it keeps the pre-image in a fixed size. The viability of this algorithm to ciphering is based on the prerogative that all lattice configurations have at least one pre-image. Therefore, we investigate if it is possible to find rule sets that guaranty the existence of one pre-image for any arbitrary lattice. The results show that Z parameter, join with its components Zleft and Zright, and the symmetry level (S) of the output bits of the rule transition can be used to specify rules with this desirable characteristic. Theses rule sets were found by using genetic algorithms.
RSS Delivery Architecture for Multi-User Terminals Using Push Service
Authors: Seung-Hwa Chung
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Web information search technique has been evolved from simple hyper text link to RSS technique that extracts information from the web, which is useful for the user, in XML format. In the case of telecommunication network, there was SMS service that sends/receives messages. But SMS service has the limitation, so Push service has been focused for the face of the converging internet to the telecommunication network. This paper proposes RSS delivery architecture using RSS relay server that monitors updated new contents and distributes them using Push service to registered multi-user terminals.
Temporalising Logics: Fifteen Years After
Authors: Michael Zakharyaschev
Venue: Proceedings of the 6th international symposium on Frontiers of Combining Systems (2007)

A straightforward way of adding a temporal dimension to a logical system is to combine it with a suitable temporal logic. Typical examples are first-order temporal logic [3], temporal description logics [1] or spatio-temporal logics [4]. In 1992, Finger and Gabbay [2] started an investigation of possible ways of temporalising abstract logical systems.
Hopfield Networks in Relevance and Redundancy Feature Selection Applied to Classification of Biomedical High-Resolution Micro-CT Images
Authors: Benjamin Auffarth, Maite López, Jesús Cerquides
Venue: Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects (2008)

We study filter---based feature selection methods for classification of biomedical images. For feature selection, we use two filters -- a relevance filter which measures usefulness of individual features for target prediction, and a redundancy filter, which measures similarity between features. As selection method that combines relevance and redundancy we try out a Hopfield network. We experimentally compare selection methods, running unitary redundancy and relevance filters, against a greedy algorithm with redundancy thresholds [9], the min-redundancy max-relevance integration [8,23,36], and our Hopfield network selection. We conclude that on the whole, Hopfield selection was one of the most successful methods, outperforming min-redundancy max-relevance when more features are selected.
Describing access control models as design patterns using roles
Authors: Dae-Kyoo Kim, Pooja Mehta, Priya Gokhale
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

An access control model describes at a high level of abstraction a mechanism for governing access to shared resources. In this paper, we view an access control model as a design pattern providing a general solution for ensuring confidentiality, integrity and availability of information resources. We present three widely used access control models, DAC, MAC and RBAC as design patterns using the POSA template. We use an extension of the UML to represent the structure and behavior of the patterns. The extension enables capturing variations of pattern instances. We also attempt to give more details on the problem domain of the patterns to help pattern selection.
Parallel Spectral Clustering
Authors: Yangqiu Song, Wen-Yen Chen, Hongjie Bai, Chih-Jen Lin, Edward Y. Chang
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

Spectral clustering algorithm has been shown to be more effective in finding clusters than most traditional algorithms. However, spectral clustering suffers from a scalability problem in both memory use and computational time when a dataset size is large. To perform clustering on large datasets, we propose to parallelize both memory use and computation on distributed computers. Through an empirical study on a large document dataset of 193,844 data instances and a large photo dataset of 637,137, we demonstrate that our parallel algorithm can effectively alleviate the scalability problem.
A Method Research on Orientation Estimation of Gas Signal Source Using Dual-Line Array
Authors: Donghai Xia, Shu Wang, Ming Zhu, Hui Tang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

For application researches of the detection for the gas signal source, a method for orientation estimation of the gas signal source in the two-dimensional space and its algorithm are presented in the paper. In the method, a mode of dual-line gas sensor array is applied to sample the signals of the gas concentration in real time, and the time delay estimation, an approach of the signal processing, is used to establish an algorithm for performing the orientation estimation of the gas signal source. Furthermore, the simulations of the method are drawn, which indicates that the method has fine veracity and robustness for estimating the orientation of the gas signal source.
Structural Identifiability in Low-Rank Matrix Factorization
Authors: Epameinondas Fritzilas, Yasmin A. Rios-Solis, Sven Rahmann
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

In many signal processing and data mining applications, we need to approximate a given matrix Y of "sensor measurements" over several experiments by a low-rank product Y ≈ A·X, where X contains source signals for each experiment, A contains source-sensor mixing coefficients, and both A and X are unknown. We assume that the only a-priori information available is that A must have zeros at certain positions; this constrains the source-sensor network connectivity pattern.In general, different AX factorizations approximate a given Y equally well, so a fundamental question is how the connectivity restricts the solution space. We present a combinatorial characterization of uniqueness up to diagonal scaling, called structural identifiability of the model, using the concept of structural rank from combinatorial matrix theory.Next, we define an optimization problem that arises in the need for efficient experimental design: to minimize the number of sensors while maintaining structural identifiability. We prove its NP-hardness and present a mixed integer linear programming framework with two cutting-plane approaches. Finally, we experimentally compare these approaches on simulated instances of various sizes.
Texture Analysis Using Modified Computational Model of Grating Cells in Content-Based Medical Image Retrieval
Authors: Gang Zhang, Z. M. Ma, Zhiping Cai, Hailong Wang
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

In neuroscience, grating cells in areas V1 and V2 of the visual cortex of monkeys can respond vigorously to a grating of bars of appropriate orientation, position and periodicity. Computational models of grating cells have been proposed and used to make texture analysis for medical images. To improve the matching precision, the computation models of grating cells were applied to the responses of simple cells and not for the pixel values of the input image. In this paper, the computational models of grating cells is modified to express uncertain information. Multi-valued logic is introduced into the computation of the responses of the grating subunit. Texture pattern is computed by means of the modified computational model of grating cells. Experiments show that the content-based medical image retrieval system using the modified computational model of grating cells has good performance.
Feasibility of Supporting Real-Time Traffic in DiffServ Architecture
Authors: Jinoo Joung
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

Since Integrated Services architecture is not scalable, it seems the only solutions for Quality of Service (QoS) architecture in the Internet are Differentiated Services (DiffServ) or its variations. It is generally understood that networks with DiffServ architectures can guarantee the end-to-end delay for packets of the highest priority class, only in lightly utilized networks. We show that, in networks without loops, the delay bounds for highest priority packets exist regardless of the level of network utilization with DiffServ architecture. These bounds are quadratically proportional to the maximum hop counts in heavily utilized networks; and are linearly proportional to the maximum hop counts in lightly utilized networks. We argue that, based on the analysis of these delay bounds in realistic situations, DiffServ architecture is able to support real time applications even in large networks. Considering that loop-free networks, especially the Ethernet networks, are being adopted more than ever for access networks and for provider networks as well, this conclusion is quite encouraging. Throughout the paper we use Latency-Rate ($\mathcal{LR}$) server model, with which it has been proved that FIFO and Strict Priority schedulers are $\mathcal{LR}$ servers to each flows in certain conditions.
Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
Authors: Zhipeng Lü, Jin-Kao Hao
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptive Tabu Search---ATS), which is aimed at minimizing violations of soft constraints. Within ATS, a new neighborhood and a mechanism for dynamically integrating Tabu Search with perturbation (from Iterated Local Search) are proposed to ensure a continuous tradeoff between intensification and diversification. The performance of the proposed hybrid heuristic algorithm is assessed on two sets of 11 public instances from the literature. Computational results show that it significantly improves the previous best known results on two problem formulations.
Design and Evaluation of IP Multipath Transmission with Feedback
Authors: Takahiro Kawamoto, Kunio Goto
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

In this research, a simple multipath IP datagram transmission scheme is proposed and implemented as a user space router program. An IP datagram is encapsulated in UDP datagram and randomly transmitted to one of the paths according to the weight calculated with the feedback information from the receiving node. Performance of the system was evaluated with a network emulator and the system is shown to be practical at up to 60Mbps.
Learning Programming with the PBL Method -- Experiences on PBL Cases and Tutoring
Authors: Esko Nuutila, Seppo Törmä, Päivi Kinnunen, Lauri Malmi
Venue: Reflections on the Teaching of Programming: Methods and Implementations (2008)

In the seven steps method of problem-based learning (PBL), students work in small groups and learn about the problem domain by trying to make sense of complex real-world cases. We have been using the seven steps method for several years to organize the learning in an introductory programming course. In this chapter, we outline the evolution and the arrangements of the course, and give examples of possible cases. The requirements for PBL cases are analyzed, as it is not straightforward to identify good cases in the area of programming. The analysis focuses on the concept of "open-ended, real-world problems" and its interpretation in the domain of programming. We relate the cases to different aspects of programming skills and present student feedback on the cases. We also report about experiments with tutorless PBL that were carried out to see if the method could scale up to courses with large numbers of students. The results were not encouraging. Student questionnaires reveal possible reasons. Firstly, when a tutor is not present, the students become insecure if they are progressing in a fruitful direction and thus, they become frustrated and lose motivation. Secondly, the behaviour of a group may deteriorate (i.e., become unbalanced or turn into irrelevant chatting).
Solving Decentralized Continuous Markov Decision Problems with Structured Reward
Authors: Emmanuel Benazera
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variables and represent individual agents with continuous measurable state-space, such as resources. Adding to the natural complexity of decentralized problems, continuous state variables lead to a blowup in potential decision points. Representing value functions as Rectangular Piecewise Constant (RPWC) functions, we formalize and detail an extension to the Coverage Set Algorithm (CSA) [1] that solves transition independent DEC-HMDPs with controlled error. We apply our algorithm to a range of multi-robot exploration problems with continuous resource constraints. 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
The Dragon Stream Cipher: Design, Analysis, and Implementation Issues
Authors: Ed Dawson, Matt Henricksen, Leonie Simpson
Venue: New Stream Cipher Designs: The eSTREAM Finalists (2008)

Dragon is a word-based stream cipher. It was submitted to the eSTREAM project in 2005 and has advanced to Phase 3 of the software profile. This paper discusses the Dragon cipher from three perspectives: design, security analysis and implementation. The design of the cipher incorporates a single word-based non-linear feedback shift register and a non-linear filter function with memory. This state is initialized with 128- or 256-bit key-IV pairs. Each clock of the stream cipher produces 64 bits of keystream, using simple operations on 32-bit words. This provides the cipher with a high degree of efficiency in a wide variety of environments, making it highly competitive relative to other symmetric ciphers. The components of Dragon were designed to resist all known attacks. Although the design has been open to public scrutiny for several years, the only published attacks to date are distinguishing attacks which require keystream lengths greatly exceeding the stated 264 bit maximum permitted keystream length for a single key-IV pair.
Simulation Method of SAR Raw Echo for Urban Scene
Authors: Yingxi Zheng, Bo Zhou, Zhulin Zhong, Ming Lv
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

In this paper, a SAR raw data simulation method for urban scene is presented based on the hypothesis that urban area is a set of vertical buildings placed over a random rough dielectric terrain. Facet model and Kirchhoff approach appropriately including multiple-scattering effects are adopted here to compute scattering coefficients in the scattering model, which operates in two-dimensional Fourier transformed domain. Methods of computing the scattering coefficients in different conditions are discussed in detail. Subsequently, the computational formulas and steps are also provided. It is known that the scattering model can effectively simulate the urban scene. The proposed simulation method of SAR raw echo turns out to be valid through simulation and analysis of the imaging to raw echo.
Face Recognition Based on Vector Quantization Building Feature Frequency Database
Authors: Yong-liang Jin, Ning-mei Yu, Dong-fang Wang, Jia Li
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

The human faces recognition has generated much research interest nowadays. However, human faces are very similar in structure with minor differences from person to person. Furthermore, lighting condition changes, facial expressions, and hairstyle variations further complicate the face recognition task as one of the difficult problems in pattern analysis. This paper proposes a new face recognition method. Extract the face information from the image and eliminate the influence of the lighting and hair. Use vector quantization (VQ) building the feature frequency database about the face information for recognition. It proved by a lot of experiments that this method has a simple algorithm, high recognition ratio. And for the different brightness, expression and hairstyle it has robustness in a certain extent. The promising results clearly demonstrate the effect of this method. Building a feature database with 30 persons, use the images with different brightness, hairstyle and expression to recognize, and the recognition ratio should achieve 97.6%. It is better than the traditional Fisherfaces and eigenfaces recognition methods.
Function Inlining in Embedded Systems with Code Size Limitation
Authors: Xinrong Zhou, Lu Yan, Johan Lilius
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Function inlining is a widely known technique that has been adopted in compiler optimization research domain. Inlining functions can eliminate the overhead resulted from function calls, but with inlining, the code size also grows unpredictably; this is not suitable for embedded processors whose memory size is relatively small. In this paper, we introduce a novel function inlining approach using the heuristic rebate_ratio, functions to be inlined are selected according to their rebate_ratios in a descending way. This kind of code optimization operation works at the source code level. Comparing with other algorithms, it is easier to implement. Our target is to get an optimal result of function inlining which can achieve the maximum performance improvement while keeping the code size within a defined limit.