ppxscal/embedding_network huggingface dataset:
A fuzzy topology for computing the interior, boundary, and exterior of spatial objects quantitatively in GIS
Authors: Wenzhong Shi, Kimfung Liu
Venue: Computers Geosciences (2007)

There have been many research developments on the conceptual description of topological relations between spatial objects. In order to practically implement these conceptual topological relations in a computer environment, we need to calculate the values of the topological relations. One of the theoretical bases for doing this is a computational fuzzy topology, which is the research focus of this study. Here, we present a development of computational fuzzy topology, which is based on the interior operator and closure operator. These operators are further defined as a coherent fuzzy topology-the complement of the open set is the closed set and vice versa; where the open set and closed set are defined by interior and closure operators-two level cuts. The elementary components of fuzzy topology for spatial objects-interior, boundary and exterior-are thus computed based on the computational fuzzy topology. An example of calculating the interior, boundary, and exterior of Mikania micrantha based on the aerial photographs of the Hong Kong countryside is provided in order to demonstrate the application of the theoretical development. Practically, the developed computational fuzzy topology is applicable for computing the values of fuzzy topological relations, such as defined conceptually by the 9-intersection model.
Image domain feature extraction from synthetic aperture imagery
Authors: M. A. Koets
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

We consider the problem of estimating a parametric model that describes radar backscattering from synthetic aperture radar imagery. We adopt a scattering center model that incorporates both frequency and aspect dependence of scattering. We develop an approximate maximum likelihood algorithm for parameter estimation directly on regions of the SAR image. The algorithm autonomously selects model order and structure. Results are presented for both synthetic and measured SAR imagery, and algorithm accuracy is compared with the Cramer-Rao bound.
Characterizing and Understanding Development Sessions
Authors: Romain Robbes, Michele Lanza
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

The understanding of development sessions, the phases during which a developer actively modifies a software system, is a valuable asset for program comprehension, since the sessions directly impact the current state and future evolution of a software system. Such information is usually lost by state-of-the-art versioning systems, because of the checkin/checkout model they rely on: a developer must explicitly commit his changes to the repository. Since this happens in arbitrary and sometimes long intervals, recovering the changes between two commits is difficult and inaccurate, and recovering the order of the changes is impossible. We have implemented an evolution monitoring prototype which records every semantic change performed on a system, and is able to completely reconstruct development sessions. In this paper we use this fine-grained information to understand and characterize the development sessions as they were carried out on two object-oriented systems.
Toward a pre-disciplinary introductory design sequence
Authors: J. L. Kolodner, J. K. Allen, B. Bullock, C. Hmelo, S. Khan, M. McCracken, F. Mistree, W. Newstetter, M. Realff
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

One of our greatest challenges in education is to prepare our students for the realities of the workplace they will be entering. In an economy characterized by global competition and continuous change, students need career-sustaining skills in addition to hard knowledge. They must know how to synthesize and integrate information; to work together in teams; to be creative; to attack open, multidisciplinary problems; to communicate the answers obtained; and to bring ideas into fruition. Recent critiques of engineering education, state the need a slightly different way. They claim that engineering education has focused too much of its energy on engineering science at the expense of engineering design. The author considers how Georgia Tech's EduTech Institute is spearheading an interdisciplinary effort to address these needs. Key to the effort is a two-quarter pre-disciplinary introduction to design. The introductory courses are designed to lay the foundations for teaming principles and strategies behind good design, reasoning involved in doing design, and cognitive and social skills a designer needs. Keeping in mind that good design requires effective collaboration and effective use of computer technology, collaboration and use of software is integral to the courses.
Learning computer hardware design using computer-aided design tools
Authors: J. M. Conrad
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The paper describes a course at the University of Arkansas with the following catalog description: CSEG/ELEG 4983: Computer Hardware Organization. Design of a complete single board computer including basic hardware organization, memory subsystem design, peripheral interfacing, DMA control, interrupt control, and bus organization.
Fundamental concepts of CS1: procedural vs. object oriented paradigm - a case study
Authors: Tamar Vilner, Ela Zur, Judith Gal-Ezer
Venue: ACM SIGCSE Bulletin (2007)

For some time, there has been an ongoing debate among Computer Science (CS) educators about the advantages and disadvantages of the shift from the procedural to the Object-Oriented (OO) paradigm. In our institution, we decided to implement this shift in the year 2005, when we changed our introductory course and started, right from the beginning, to teach the Java language, instead of the procedural facet of C++. While we still offered the two different paradigms in parallel, we had two similar groups each taking one of the paradigms. These two groups served as the research population of the study we describe in this paper. We examined whether the shift from the procedural to the OO paradigm had an effect on students' perception of fundamental concepts taught in the introductory course.
Interactive Skeleton Extraction Using Geodesic Distance
Authors: Takuya Oda, Yuichi Itoh, Wataru Nakai, Katsuhiro Nomura, Yoshifumi Kitamura, Fumio Kishino
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper proposes a method of extracting skeleton interactively for 3D character animation. A skeleton is automatically and interactively generated from the object data of 3D models in a process that consists of five steps: 1) transformation into a low polygon model from the original model composed of a large number of polygons; 2) calculation of the sum of the geodesic distance from specific points to all vertices on the 3D model; 3) subdivision of the 3D model using the sum of geodesic distances; 4) generation of skeleton joints (skeleton nodes) on each boundary surface between those subdivision areas; and 5) connection of all skeleton nodes. We also propose a method for flexible skeleton generation using boundary shapes and the sum of geodesic distances. After generating the skeleton, various animations can be created by interpolating key poses created from user manipulation of skeleton joints. Since skeletons can be generated with this method where specified by users, users are expected to create interactively flexible animations of 3D models.
Jeliot 3 in a Demanding Educational Setting
Authors: Andrés Moreno, Mike S. Joy
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We report the preliminary findings of a qualitative investigation into how students approach a program visualization tool, and whether the approach depends on how they are taught to use the tool. Volunteer students in an undergraduate programming course were divided into two groups. One group was taught programming concepts explicitly using the tool, and required to use it to solve weekly exercises and projects, whereas the other group only used the tool on a voluntary basis. We identify those aspects of using the tool which the students find beneficial, and discuss the limitations of the animations provided by Jeliot 3.
Report on the XML mining track at INEX 2005 and INEX 2006: categorization and clustering of XML documents
Authors: Ludovic Denoyer, Patrick Gallinari
Venue: ACM SIGIR Forum (2007)

This article is a report concerning the two years of the XML Mining track at INEX (2005 and 2006). We focus here on the classification and clustering of XML documents. We detail these two tasks and the corpus used for this challenge and then present a summary of the different methods proposed by the participants. We last compare the results obtained during the two years of the track.
An Evolutionary Solution for Cross Layer Ad Hoc Connectivity Selection
Authors: Markus Borschbach, Matthias Vodel
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

The physical connectivity of ad hoc networks has gained the importance of a challenging problem for the efficiency of the routing and the link layer management. The application of an appropriate network description proposed in this paper provides the opportunity to realize local neighbor selection rules which are superior to related work in this field under the networking aspect of the over all sum of shortest paths. The remaining network topology is compared to the main approaches of ad hoc connectivity in an empirical simulation study. To minimize the computational complexity of the neighbor selection optimization constraints, a specific evolutionary operation design is used.
A New Classification Scheme for Anonymization of Real Data Used in IDS Benchmarking
Authors: Vidar Evenrud Seeberg, Slobodan Petrovic
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Artificially generated network traffic sources for IDS benchmarking have been harshly criticized because of their inability to realistically simulate networks. Benchmarking data sets based on real data have many advantages over the artificially generated ones, but due to privacy concerns and legal restrictions such original data sets cannot be widely distributed. Their anonymization ("sanitization") is necessary in order to be used in IDS testing. In this paper, we define a new variable strength filter-in methodology of anonymization of IDS benchmarking data sets. It is based on an original classification criterion used to categorize informational objects in network data according to the action to be performed on them in the anonymization process. The action depends on the possibility of these objects to disclose sensitive information. We analyze the possibility of disclosing sensitive information by various http header fields. We also study influence of application of the new anonymization methodology on percentage of attacks detectable by an IDS. Experimental results show that a great number of the attacks present in the input data without anonymization are still detectable by the tested IDS even after the application of the strongest anonymization scheme defined by our methodology. Although the new anonymization method focuses on application data, it could also be used in the link, network, and transport protocol contexts.
A Survey of Approaches to Adaptive Application Security
Authors: Ahmed Elkhodary, Jon Whittle
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Adaptive systems dynamically change their behavior or structure at runtime to respond to environmental changes. This paper considers one class of adaptive systems - those that adapt application-level security mechanisms. Nowadays, adaptive software security is gaining greater attention as a way to balance the tradeoff between systems security and IT infrastructure overhead. Several adaptive security systems have been developed recently supporting hardware-level to application-level reconfiguration. This paper surveys four adaptive application-level security systems and evaluates them in terms of how well they support critical security services (i.e. authentication, authorization, and tolerance) and what level of adaptation they achieve. Based on our evaluation results, we provide recommendations for future research.
Motion estimation using a volume conservation hypothesis
Authors: D. Bereziat
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Motion estimation is one of the main subjects in computer vision. Many methods developed to compute motion make use of the optical flow hypothesis. These methods usually fail to capture motion of objects with intensity evolution. We propose a new approach to solve the motion computation problem with a different type of constancy hypothesis. Because we are mainly interested in deformable moving structures, we postulate that such a structure, within a temporal image sequence, is associated with a constant volume or a constant total intensity over time. We call this postulate the volume conservation hypothesis. Results are displayed for clouds motion and deformation on meteorological satellites images.
A statistical approach to risk mitigation in computational markets
Authors: Thomas Sandholm, Kevin Lai
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

We study stochastic models to mitigate the risk of poor Quality-of-Service (QoS) in computational markets. Consumers whopurchase services expect both price and performance guarantees. They need to predict future demand to budget for sustained performance despite price fluctuations. Conversely, providers need to estimate demand to price future usage. The skewed and bursty nature of demand in large-scale computer networks challenges the common statistical assumptions of symmetry, independence, and stationarity. This discrepancy leads to under estimation of investment risk. We confirm this non-normal distribution behavior in our study of demand in computational markets. The high agility of a dynamic resource market requires flexible, efficient, and adaptable predictions. Computational needs are typically expressed using performance levels, hence we estimate worst-case bounds of price distributions to mitigate the risk of missing execution deadlines. To meet these needs, we use moving time windows of statistics to approximate price percentile functions. We use snapshots of summary statistics to calculate prediction intervals and estimate model uncertainty. Our approach is model-agnostic, distribution-free both in prices and prediction errors, and does not require extensive sampling nor manual parameter tuning. Our simulations and experiments show that a Chebyshev inequality model generates accurate predictions with minimal sample data requirements. We also show that this approach mitigates the risk of dropped service level performance when selecting hosts to run a bag-of-task Grid application simulation in a live computational market cluster.
Interframe Bus Encoding Technique for Low Power Video Compression
Authors: Asral Bahari, Tughrul Arslan, Ahmet T. Erdogan
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This paper proposes a data encoder to reduce switched capacitance on system bus. Our method focuses on transferring raw video data (pixels) between off-chip memory and on-chip memory which is common in video compression applications. This method is based on entropy coding to minimize bus transition. The existing technique exploits the correlation between neighbouring pixels. In our technique, we exploit pixel correlation between two consecutive frames. Our method shows 54% transition saving when combined with the existing technique which is equivalent to 38% power saving for 15pF off-chip bus capacitance. This method is suitable for applications where multiple frames are transferred from off-chip memories such as in MPEG-4 AVC/H.264 encoder.
A multivariate speech activity detector based on the syllable rate
Authors: D. C. Smith
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

Computationally efficient speech extraction algorithms have significant potential economic benefit, by automating an extremely tedious manual process. Previously, algorithms which discriminate between speech and one specific other signal type have been developed, and often fail when the specific non-speech signal is replaced by a different signal type. Moreover, several such signal specific discriminators have been combined in order to tackle the general speech vs. non-speech discrimination problem, with predictable negative results. When the number of discriminating features is large, compression methods such as principal components have been applied to reduce dimension, even though information may be lost in the process. In this paper, graphical tools are applied to determine a set of features which produce excellent speech vs. nonspeech clustering. This cluster structure provides the basis for a general speech vs. non-speech discriminator, which significantly outperforms the TALKATIVE speech extraction algorithm.
The Complexity of Tensor Circuit Evaluation
Authors: Martin Beaudry, Markus Holzer
Venue: Computational Complexity (2007)

We continue the study of tensor calculus over semirings in terms of complexity theory initiated by Damm et al. (2003). First, we look at tensor circuits, a natural generalization of tensor formulas; we show that the problem to determine whether the circuit output over a certain semiring is non-zero is complete for NE = NTime(2 O(n)) over the Boolean semiring, for $$\oplus$$ E over the field $$\mathbb{F}_{2}$$ , and for analogous classes over other semirings. Moreover, common-sense restrictions such as imposing bounds on circuit and/or tensor depth, are shown to elegantly capture the classes P, NTime $$(2^{O(log^{k} n)})$$ , NTimeSpace( $$2^{O(log^{k} n)}$$ , n O(1)), for k ¿ 1, PSPACE, and their counting counterparts. The proofs of these results use a model of algebraic Turing machines over a semiring together with a predicate-based approach on counting, which is similar to that of Toda (1991). This allows characterizations of the classes $$\oplus$$ P, NP, co-NP, co-DP, C=P, SPP, USP, and UP, and their exponential time counterparts, in a single framework. Finally, we show that a number of natural problems concerning tensor formulas and circuits, such as asking whether the output of a formula/circuit is a diagonal matrix, or the identity matrix, or a permutation matrix, capture the classes $$\prod^{p}_{2}$$ for formulas and $$\prod^{e}_{2}$$ for circuits over the Boolean semiring; other semirings are also discussed.
Optimal array processing for non-stationary signals
Authors: P. Chevalier
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

The optimal array filtering problem consists mainly of implementing a complex linear and time invariant (TI) filter, optimizing a second order criterion at the output, under some possible constraints and assuming stationary signals. This approach is optimal for stationary signals, but becomes sub-optimal for non-stationary signals for which the optimal complex filters an time variant (TV) and, under some conditions of non-circularity, widely linear (WL). The purpose of this paper is to demonstrate these results, to touch lightly on the implementation problems of TV filters, to give a sense to the classical approach for non-stationary signals and to show, on a particular example borrowed from the radiocommunications field, the interest of WL structures with respect to linear ones in non-stationary environments.
Untitled Evolution
Authors: Gary Singh
Venue: IEEE Computer Graphics and Applications (2007)

This issue's cover features art by Terry Calen. In this article, Calen describes his work and his process.
Reception-Aware Routing for Energy Conservation in Ad Hoc Networks
Authors: Nirisha Shrestha
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Energy is a scarce resource in ad hoc mobile networks, making energy-aware communication crucial. In the ab- sence of a central controlling entity and due to its dynamic network topology, the problem of controlling the network communications in an energy-efficient way is non-trivial in ad hoc networks. The problem is elevated due to the wire- less nature of the communication, where a large amount of energy expenditure in the nodes is due to overhearing pack- ets not meant for themselves. In this paper, we introduce battery-aware routing metrics which not only take care of the battery reserve in the nodes in the routes, but also the number of neighbors these nodes can potentially interfere, and the energy reserve of these neighbors, such that the en- ergy due to overhearing is minimized throughout the net- work, specially when the neighbors are battery-deficient.
Unified support for heterogeneous security policies in distributed systems
Authors: Naftaly H. Minsky, Victoria Ungureanu
Venue: Proceedings of the 7th conference on USENIX Security Symposium - Volume 7 (1998)

Modern distributed systems tend to be conglomerates of heterogeneous subsystems, which have been designed separately, by different people, with little, if any, knowledge of each other - and which may be governed by different security policies. A single software agent operating within such a system may find itself interacting with, or even belonging to, several subsystems, and thus be subject to several disparate policies. If every such policy is expressed by means of a different formalism and enforced with a different mechanism, the situation can get easily out of hand. To deal with this problem we propose in this paper a security mechanism that can support efficiently, and in a unified manner, a wide range of security models and policies, including: conventional discretionary models that use capabilities or access-control lists, mandatory lattice-based access control models, and the more sophisticated models and policies required for commercial applications. Moreover, under the proposed mechanism, a single agent may be involved in several different modes of interactions that are subject to disparate security policies.
New Korkin-Zolotarev Inequalities
Authors: R. A. Pendavingh, S. H. M. van Zwam
Venue: SIAM Journal on Optimization (2007)

Korkin and Zolotarev showed that if $$\sum_i A_i\Big(x_i-\sum_{j>i} \alpha_{ij}x_j\Big)^2$$ is the Lagrange expansion of a Korkin-Zolotarev (KZ-) reduced positive definite quadratic form, then $A_{i+1}\geq \frac{3}{4} A_i$ and $A_{i+2}\geq \frac{2}{3}A_i$. They showed that the implied bound $A_{5}\geq \frac{4}{9}A_1$ is not attained by any KZ-reduced form. We propose a method to optimize numerically over the set of Lagrange expansions of KZ-reduced quadratic forms using a semidefinite relaxation combined with a branch and bound process. We use a rounding technique to derive exact results from the numerical data. Applying these methods, we prove several new linear inequalities on the $A_i$ of any KZ-reduced form, one of them being $A_{i+4}\geq (\frac{15}{32}-2 \cdot 10^{-5})A_i$. We also give a form with $A_{5}= \frac{15}{32}A_1$. These new inequalities are then used to study the cone of outer coefficients of KZ-reduced forms, to find bounds on Hermite&rsquo;s constant, and to give better estimates on the quality of $k$-block KZ-reduced lattice bases.