ppxscal/embedding_network huggingface dataset:
Processing Sparse Panoramic Images via Space Variant Operators
Authors: Sonya Coleman, Bryan Scotney, Dermot Kerr
Venue: Journal of Mathematical Imaging and Vision (2008)

The use of omni-directional cameras has become increasingly popular in vision systems for video surveillance and autonomous robot navigation. However, to date most of the research relating to omni-directional cameras has focussed on the design of the camera or the way in which to project the omni-directional image to a panoramic view rather than the processing of such images after capture. Typically images obtained from omni-directional cameras are transformed to sparse panoramic images that are interpolated to obtain a complete panoramic view prior to low level image processing. This interpolation presents a significant computational overhead with respect to real-time vision.We present an efficient design procedure for space variant feature extraction operators that can be applied to a sparse panoramic image and directly processes this sparse image. This paper highlights the reduction of the computational overheads of directly processing images arising from omni-directional cameras through efficient coding and storage, whilst retaining accuracy sufficient for application to real-time robot vision.
Bivalent Verbs and Their Pragmatic Particularities
Authors: Bogdan Patrut, Iulian Marius Furdu, Monica Patrut
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

In this paper we present some pragmatic particularities of verbs describing actions or feelings that can appear between two human beings.
Route Identification and Direction Control of Smart Car Based on CMOS Image Sensor
Authors: Wang Xiuquan, Shen Xiaoliu, Chang Xiaoming, Chai Ying
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

This paper is designed for the 2nd Freescale Cup National Undergraduate Smart Car Competition. With MC9S12DG128 single chip and smart car model supplied by the committee, a CMOS image sensor is applied to detect the black track on white raceway, which extends the detection range and is helpful to predict the forward path. In this paper, ten-line pixels in an image are analyzed to locate the black track, and the PD algorithm based on PID is employed to control the direction and angle of the steering gear respectively. By repeated testing, the smart car can run stably on the given raceway at a high speed.
Transforming the ar Χ iv to XML
Authors: Heinrich Stamerjohanns, Michael Kohlhase
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

We describe an experiment of transforming large collections of documents to more machine-understandable representations. Concretely, we are translating the collection of scientific publications of the Cornell e-Print Archive (arXiv) using the to XML converter which is currently under development.The main technical task of our arXMLiv project is to supply LaTeXML bindings for the (thousands of) classes and packages used in the arXiv collection. For this we have developed a distributed build system that reiteratively runs LaTeXML over the arXiv collection and collects statistics about e.g. the most sorely missing LaTeXML bindings and clusters common error events. This creates valuable feedback to both the developers of the LaTeXML package and to binding implementers. We have now processed the complete arXiv collection of more than 400,000 documents from 1993 until 2006 (one run is a processor-year-size undertaking) and have continuously improved our success rate to more than 56% (i.e. over 56% of the documents that are have been converted by LaTeXML without noticing an error and are available as XHTML+MathML documents).
Digital Therapy: Addressing Willpower as Part of the Cognitive-Affective Processing System in the Service of Habit Change
Authors: Pål Kraft, Filip Drozd, Elin Olsen
Venue: Proceedings of the 3rd international conference on Persuasive Technology (2008)

We know much too little about how to design effective digital interventions to support sustained behavior change and improved well-being. The purpose of the present paper was to contribute in two ways. First, we want to contribute to current practice in designing such interventions. Second, we try to identify key research questions that could be a point of departure for a more detailed and comprehensive future research program. The propositions we suggest reflect that the construction of digital interventions should be seen as an iterative process which should take into account both "content" and "design" factors. However, we argue that intervention research and practical design experience is not just something that follows basic research at a polite distance, but rather is its inherent complement.
Constraint-Based School Timetabling Using Hybrid Genetic Algorithms
Authors: Tuncay Yigit
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

In this paper, a hybrid genetic algorithm (HGA) has been developed to solve the constraint-based school timetabling problem (CB-STTP). HGA has a new operator called repair operator, in addition to standard crossover and mutation operators. A timetabling tool has been developed for HGA to solve CB-STTP. The timetabling tool has been tested extensively using real-word data obtained the Technical and Vocational High Schools in Turkey. Experimental results have presented that performance of HGA is better than performance of standard GA.
Constructing Flexible Application Servers with Off-the-Shelf Middleware Services Integration Framework
Authors: Yan Li, Minghui Zhou, Donggang Cao, Lu Zhang
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

With the ever increasing complexity and scale of application server and the emergence of reliable OTS middleware service components, more and more application server vendors are inclined to reuse OTS middleware services in the construction of the application server. However, in conventional OTS middleware service integration, flexibility is sacrificed by hard coding concrete OTS middleware services. This paper proposes CAC (Contract, Adapter, and Configuration), a framework to integrate OTS middleware services in a flexible way. The evaluations show that our framework effectively reduces the cost of application server maintenance and OTS products customization.
Semi-automatic Ontology Construction for Improving Comprehension of Legal Documents
Authors: Bojan Cestnik, Alenka Kern, Helena Modrijan
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

In this paper we present a new method based on semi-automatic ontology construction that can be used to improve the understandability of legal documents. Legal documents typically extensively define requirements and procedures in a specific legislative area; usually, they are hard to comprehend for citizens without a proper legal knowledge. However, a vast majority of today's e-Government activities for citizens (G2C) are governed by legal documents. Therefore, by improving the citizen's comprehension many intricacies that occasionally occur during G2C activities can be avoided. Our method first divides a legal document into several paragraphs. From the paragraphs it semi-automatically constructs ontology of the field by using a tool OntoGen. Ontology concepts are then used to classify each paragraph and the resulting classification is visualized in a simple matrix, where rows represent paragraphs and columns represent top-level ontology concepts. Based on the visualization, paragraphs that need revising are identified; they can be relocated to more suitable context within the document or rewritten using more appropriate wording. We demonstrate the presented method on the document defining the tender for selling flats at favorable prices at the Housing Fund of the Republic of Slovenia, a public fund. We argue that by using the new method we were able to substantially improve the comprehension of the document. In addition, the constructed ontology helped the Fund's officers improve the structure of their knowledge about the underlying business process.
Evaluation of the Slovak Spoken Dialogue System Based on ITU-T
Authors: Stanislav Ondáš, Jozef Juhár, Anton Čižmár
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

The development of the Slovak spoken dialogue system started in year 2006. The developed system is publicly available as a trial system and provides weather forecast and timetables information services. One of the very important questions is how to evaluate quality of such a system. A new method for quality assessment of the spoken dialogue system is proposed. The designed method is based on ITU-T P.851 recommendation. Three types of questionnaires were prepared --- A, B and C. The questionnaires serve for obtaining information about user's background, completed interactions with the system and about overall impression of the system and its services. Scenarios, methodology of coding, classifying and rating of collected data were also developed. There are also six classes of quality for representation of system's features. Introduced method was used for evaluation of the dialogue system and timetables information service. This paper also summarizes the results of performed experiment.
Time-predictable memory arbitration for a Java chip-multiprocessor
Authors: Christof Pitter
Venue: Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems (2008)

In this paper, we propose an approach to calculate worst-case execution times (WCET) of tasks running on a homogeneous Java multiprocessor. These processors access a shared main memory. Hence, the tasks running on different CPUs may influence the execution times of each other. Therefore, we implemented a time division multiple access arbiter that divides the memory access time into equal time slots, one time slot for each CPU. This memory arbitration allows calculating upper bounds for the execution time of Java bytecodes depending on the number of CPUs, the size of the time slot, and the memory access time. A WCET analysis tool can utilize these results and generate temporal, upper bounds for application tasks. We further explore how the size of the time slot and the number of CPUs in the system influence the WCET results. Furthermore, a real-world application task is used to compare the analyzed results with measured execution times. This paper describes the timing analysis of a time-predictable Java multiprocessor with shared memory.
A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks
Authors: Yongan Wu, Min Li, Zhiping Cai, En Zhu
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

The fundamental issue in sensor networks is providing a certain degree of coverage and maintaining connectivity under the energy constraint. In this paper, the connected k-coverage problem is investigated under the probabilistic sensing and communication models, which are more realistic than deterministic models. Furthermore, different weights for nodes are added in order to estimate the real power consumption. Because the problem is NP-hard, a distributed probabilistic coverage and connectivity maintenance algorithm (DPCCM) for dense sensor networks is proposed. DPCCM converts task requirement into two parameters by using the consequence of Chebyshev's inequality, then activate sensors based on the properties of weighted &epsilon;-net. It is proved that the sensors chosen by DPCCM have (&theta;,k)-coverage and &alpha;-connectivity. And the time and communication complexities are theoretically analyzed. Simulation results show that compared with the distributed randomized k-coverage algorithm, DPCCM significantly maintain coverage in probabilistic model and prolong the network lifetime in some sense.
Contextual multi-dimensional browsing
Authors: Ling-Ling Wu, Ya-Lan Chuang, Yuh-Jzer Joung
Venue: Computers in Human Behavior (2008)

Browsing efficiency depends to a large extent on the organization of the information being browsed. An emerging method of organizing Web content, called multi-faceted categorization, adopts a flat structure and treats different facets of the browsed content as equal and independent. The advantage of this structure is that it allows users to slice and dice the information space from any of the facets they wish to browse, and in any arbitrary order, thereby facilitating so-called multi-dimensional browsing. However, because of limited human information processing capacities, too many choices and too much browsing freedom tend to disorient users and increase the difficulty of information gathering. A more effective means of organizing information is therefore needed. In the literature, it is well documented that context plays a crucial role in making relevance judgments about categorical attributes. Since browsing always occurs in relation to certain contexts, we propose taking context into account for multi-faceted categorization to help organize different facets of information on the browsing interface. Our experiment results demonstrate that the context-sensitive arrangement of categories helps users find information more efficiently. Moreover, users perceive the context-sensitive interface as easier to use than non-contextual interfaces.
Peer-to-Peer File Sharing Based on Network Coding
Authors: Min Yang, Yuanyuan Yang
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Network coding is a promising enhancement of routing to improve network throughput and provide high reliability. It allows a node to generate output messages by encoding its received messages. Peer-to-peer networks are a perfect place to apply network coding due to two reasons: the topology of a peer-to-peer network is constructed arbitrarily, thus it is easy to tailor the topology to facilitate network coding; the nodes in a peer-to-peer network are end hosts which can perform more complex operations such as decoding and encoding than simply storing and forwarding messages. In this paper, we propose a scheme to apply network coding to peer-to-peer file sharing which employs a peer-to-peer network to distribute files resided in a web server or a file server. The scheme exploits a special type of network topology called combination network. It is proved that combination networks can achieve unbounded network coding gain measured by the ratio of network throughput with network coding to that without network coding. The scheme encodes a file into multiple messages and divides peers into multiple groups with each group responsible for relaying one of the messages. The encoding scheme is designed to satisfy the property that any subset of the messages can be used to decode the original file as long as the size of the subset is sufficiently large. To meet this requirement, we first define a deterministic linear network coding scheme which satisfies the desired property, then we connect peers in the same group to flood the corresponding message, and connect peers in different groups to distribute messages for decoding. Moreover, the scheme can be readily extended to support topology awareness to further improve system performance in terms of throughput, reliability and link stress. Our simulation results show that the new scheme can achieve 15%-20% higher throughput than Narada which does not employ network coding. In addition, it achieves good reliability and robustness to link failure or churn.
Modelling Clustering of Sensor Networks with Synchronised Hyperedge Replacement
Authors: Mohammad Hammoudeh
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

This paper proposes Synchronised Hyperedge Replacement (SHR) as a suitable modelling framework for Wireless Sensor Networks (WSN). SHR facilitates explicit modelling of WSN applications environmental conditions (that greatly affect the applications performance) while providing a sufficiently high level of abstraction for the specification of the adopted clustering mechanism. We model with SHR few communication and coordination aspects of a new algorithm, Balanced Minimum Radius Clustering (BMRC), for solving the balanced clustering problem.
Recovering Consistency by Forgetting Inconsistency
Authors: Sylvie Coste-Marquis, Pierre Marquis
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

In this paper, we introduce and study a new paraconsistent inference relation ¿ c in the setting of 3-valued paraconsistent logics. Using inconsistency forgetting as a key mechanism for recovering consistency, it guarantees that the deductive closure $Cn_{\models_c}(\Sigma)$ of any belief base Σ is classically consistent and classically closed. This strong feature, not shared by previous inference relations in the same setting, allows to interpret an inconsistent belief base as a set of classical worlds (hence to reason classically from them).
DynaTest and beyond: From dynamic testing to automated error-prevention and error-detection
Authors: David C. Pheanis, John A. Jackson, Lance G. Johnson
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

DynaTest, which stands for Dynamic Tester, is a macro-language software-testing and validation system that verifies programs, subroutines, and interrupt-handler routines written in assembly language. A scriptwriter writes a DynaTest test driver in a test-script language that specifically supports the development of test scripts. DynaTest uses comparative analysis of a combination of automatically generated pseudo-random test cases and handpicked test cases against a known, working solution. The current version of DynaTest executes on specific hardware platforms. The documented results speak for themselves. Using DynaTest has improved error detection tremendously while dramatically decreasing test-preparation time. Unfortunately, no matter how impressive DynaTest is, it always faces the limited-resource constraints of small microprocessors in embedded systems. With the ever-increasing performance of today's personal computers, a simulated embedded-processor environment opens the way for numerous possible error-prevention and error-detection tools. By wrapping these tools around a simulated embedded-processor environment, we can completely control and analyze the execution phase of a software system. Many tools for high-level languages work by incorporating themselves into the target program, affecting the memory layout and timing of the code. With our tools, we do not modify the target program, and the simulated environment keeps the timing and the memory map unchanged.
Texture Based Classification and Segmentation of Tissues Using DT-CWT Feature Extraction Methods
Authors: Dogu Baran Aydogan, Markus Hannula, Tuukka Arola, Prasun Dastidar, Jari Hyttinen
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

In this study, four different dual-tree complex wavelet (DT-CWT) based texture feature extraction methods are developed and compared to segment and classify tissues. Methods that are proposed in this study are based on local energy calculations of sub-bands. Two of the methods use rotation variant texture features and the other two use rotation invariant features. The methods are tested on two texture compositions from the Brodatz texture database and two actual magnetic resonance (MR) images. Results show that there is not a significant difference between using rotation variant or invariant features. On the other hand, for the same Brodatz textures, all DT-CWT based feature extraction methods are competitive with other filtering approaches.
Merging Groups for the Exploration of Complex State Spaces in the CPSO Approach
Authors: Stefanie Thiem, Jörg Lässig, Peter Köchel
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

In recent years many investigations have shown that Particle Swarm Optimization (PSO) is a very competitive global optimization heuristic. However, in very complex state spaces the classical PSO algorithm converges too fast and hence provides only suboptimal results. Looking at swarm robotics it seems natural to adopt a repulsive force to avoid this undesired behavior as suggested in Charged PSO but the downside of this is the problem of final convergence in static applications.The contribution of this paper is to introduce a dynamic charge reduction over time defining particle groups which are iteratively merged, reducing the number of charged particles during the optimization run.A visualization of this process shows spontaneous formation of independent particle groups, redolent very much of swarm movement in nature. Optimization results are superior compared to other PSO approaches especially in very complex high dimensional search spaces.
On Cryptographically Significant Mappings over GF(2n)
Authors: Enes Pasalic
Venue: Proceedings of the 2nd international workshop on Arithmetic of Finite Fields (2008)

In this paper we investigate the algebraic properties of important cryptographic primitives called substitution boxes (S-boxes). An S-box is a mapping that takes n binary inputs whose image is a binary m-tuple; therefore it is represented as $F:\text{GF}(2)^n \rightarrow \text{GF}(2)^m$. One of the most important cryptographic applications is the case n = m, thus the S-box may be viewed as a function over $\text{GF}(2^n)$. We show that certain classes of functions over $\text{GF}(2^n)$ do not possess a cryptographic property known as APN (Almost Perfect Nonlinear) permutations. On the other hand, when n is odd, an infinite class of APN permutations may be derived in a recursive manner, that is starting with a specific APN permutation on $\text{GF}(2^k)$, k odd, APN permutations are derived over $\text{GF}(2^{k+2i})$ for any i ¿ 1. Some theoretical results related to permutation polynomials and algebraic properties of the functions in the ring $\text{GF}(q)[x,y]$ are also presented. For sparse polynomials over the field $\text{GF}(2^n)$, an efficient algorithm for finding low degree I/O equations is proposed.
Inconsistency of logical and physical topologies for overlay networks and its effect on file transfer delay
Authors: Yasuo Tamura, Shoji Kasahara, Yutaka Takahashi, Satoshi Kamei, Ryoichi Kawahara
Venue: Performance Evaluation (2008)

In overlay networks consisting of underlying physical nodes and links, data files are transferred by overlay routing managed at application level. The end-to-end file transfer delay depends on both logical and physical topologies resulting from overlay routing. In this paper, we focus on six types of four-terminal four-router physical networks, and investigate the impact of topology inconsistency on the file transfer delay. The analysis model is based on a two-layer queueing network, taking into account both logical and physical topologies. The model is validated in comparison with ns-2 simulation. Numerical examples show that the end-to-end file transfer delay is small when both logical and physical topologies are the same. It is also observed that the end-to-end delay significantly depends on the traffic intensity for some logical topologies, regardless of physical topology.