ppxscal/embedding_network huggingface dataset:
Wittgenstein&rsquo;s Tractatus Project as Philosophy of Information
Authors: R. A. Young
Venue: Minds and Machines (2004)

It is argued that the Tractatus Project of Logical Atomism, in which the world is conceived of as the totality of independent atomic facts, can usefully be understood by conceiving of each fact as a bit in &lsquo;logical space&rsquo;. Wittgenstein himself thinks in terms of logical space. His &lsquo;elementary propositions&rsquo;, which express atomic facts, are interpreted as tuples of co-ordinates which specify the location of a bit in logical space. He says that signs for elementary propositions are arrangements of names. Here, the names are understood as numerical symbols specifying coordinates. It is argued that, using this approach, the so-called &lsquo;colour-exclusion&rsquo; problem, which was Wittgenstein&rsquo;s reason for abandoning the Tractatus, is in fact soluble. However, if logical space is a continuum then some coordinates will need to be expressed by numerical symbols that are infinite in size. How is this to be understood in Tractatus terms? It is shown that, in the Tractatus, Wittgenstein did recognise the possibility of infinite propositions and sentences expressing them. At first sight his approach to infinite sentences, and the approach of the present paper, seem to differ, but it is argued that the difference is superficial. Finally, we address the question of whether Logical Atomism is viable and this raises issues concerning its relationship to natural science.
On the need for fewer restrictions in changing compile-time environments
Authors: David L. Parnas, John E. Shore, W. David Elliott
Venue: ACM SIGPLAN Notices (1975)

Compilers for current programming languages enforce rigid restrictions on changes, during the compilation of a statement, in the set of associations between names and declarations, that is, on changes in the compile-time environment of the statement. These restrictions inhibit the writing of well-structured, modular programs, because such programs tend to require frequent switching between the environments associated with different modules. With current compilers, arbitrary switching of environments must be handled by means of macros at compile time or deferred until run time. Conventional macros are difficult to use in situations where it is desirable that the macro writer and the macro user be ignorant about each other's programs. When deferred until run time, frequent switching of environments becomes costly owing to the overhead associated with subroutine calls. In order to encourage the compartmentalization of program information and at the same time to allow efficient code generation, we propose the relaxation of present restrictions on changes in the compile-time environment. Specifically, we propose that a group of declarations can be defined as an environment and that arbitrary pieces of program text can state within which environment they are to be compiled. With such a mechanism, program text can be intermixed by means of macros without having to make the relevant declarations global or having to repeat the declarations in places other than the environment's definition.
Temporal Properties of Turn-Taking and Turn-Packaging in Synchronous Computer-Mediated Communication
Authors: Claude G. "ech, Sherri L. Condon
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

Turn structure and timing are examined in a variety of quasi-synchronous computer-mediated interfaces. The message window size, presence of scrolling, a single message window vs. message windows for each participant, and message persistence were systematically varied for pairs of interlocutors engaged in the same decision-making task. Participants produced more total words and more turns in conditions with larger windows and in those with scrolling, while separate windows conditioned even larger increases on these measures. Turn sizes were smaller in the latter conditions and response times were faster. In the persistent separate-window conditions, messages from the partner intervened before participants completed responses in over half of the messages.
An accurate and fast point-to-plane registration technique
Authors: Soon-Yong Park, Murali Subbarao
Venue: Pattern Recognition Letters (2003)

This paper addresses a registration refinement problem and presents an accurate and fast point-to-(tangent) plane technique. Point-to-plane approach is known to be very accurate for registration refinment of partial 3D surfaces. However, the computation complexity for finding the intersection point on a destination surface from a source control point is hindering the algorithm from real-time applications. We introduce a novel point-to-plane registration technique by combining the high-speed advantage of point-to-projection technique. In order to find the intersection point fast and accurately, we forward-project the source point to the destination surface and reproject the projection point to the normal vector of the source point. We show that iterative projections of the projected destination point to the normal vector converge to the intersection point. By assuming the destination surface to be a monotonic function in a new 2D coordinate system, we show contraction mapping properties of our iterative projection technique. Experimental results for several objects are presented for both pair-wise and multi-view registrations.
The VLSI-programming language tangram and its translation into handshake circuits
Authors: Kees van Berkel, Joep Kessels, Marly Roncken, Ronald Saeijs, Frits Schalij
Venue: Proceedings of the conference on European design automation (1991)

In this paper we view VLSI design as a programming activity. VLSI designs are described in the algorithmic programming language Tangram. The paper gives an overview of Tangram, providing sufficient detail to invite the reader to try a small VLSI program himself. Tangram programs can be translated into handshake circuits, networks of elementary components that interact by handshake signaling. We have constructed a silicon compiler that automates this translation and converts these handshake circuits into asynchronous circuits and subsequently into VLSI layouts.
Towards a sociopragmatic-constructivist understanding of information systems
Authors: Boris Wyssusek, Martin Schwartz
Venue: Computing information technology: the human side (2003)

Contemporary understanding of information systems (IS) is flawed by fundamental problems in information systems research and practice. In this chapter, we claim that philosophical presuppositions have a great influence on our understanding of IS. Reflecting on the modernism-postmodernism debate and its methodological consequences for IS research, we derive the need for a paradigmatic foundation of IS research. Referring to Kuhn's concept of "paradigm," we develop a framework for the conceptualization of "paradigms of inquiry." We use the notion of "model," which we believe to be pivotal for the understanding of IS, to illustrate the implications of the adoption of a "paradigm of inquiry." In response to a criticism of both the positivist and the radical-constructivist paradigms, we develop a paradigm called "sociopragmatic constructivism" (SPC). Presupposing that human inquiry relies on social contextualization, common practice and cultural history, we propose an agenda for upcoming IS research grounded in SPC.
Continuous domains as formal spaces
Authors: Sara Negri
Venue: Mathematical Structures in Computer Science (2002)

The connections between formal topology and domain theory are surveyed and various types of continuous domains are represented as formal spaces through locally Stone and locally Scott formal topologies.
Distinguishing video quality through differential matrices
Authors: Marcelo Dias de Amorim, Otto Carlos M. B. Duarte, Guy Pujolle
Venue: Multimedia Systems (2003)

Multicast multi-layered communications must implement efficient control algorithms to address undesirable network behaviors. This paper proposes two multi-metric algorithms for computing the rates of the video layers and improve the global video quality of a multicast session. In fact, we show that a single-metric approach may degrade some network parameters without obtaining any substantial improvements. Our first algorithm combines three metrics and a set of weights in such a way that one metric can be prioritized. This leads to an improved quality of multicast sessions, as we show through a number of experiments. In networks where the available resources are highly variable, however, the stability of the video quality is compromised if absolute values of the metrics are adopted. We then propose a second algorithm that uses the relative values of the metrics on a per-entry basis Computation of the global quality of the multicast session is based on a differential matrix that stores the metrics for each receiver. This scheme takes into account the dynamics of the available resources and the heterogeneity of receivers. The great benefit of this approach is that the global video quality is always improved for every loop of the algorithm.
Strings: Variational Deformable Models of Multivariate Continuous Boundary Features
Authors: Sennay Ghebreab, Arnold W. M. Smeulders
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

We propose a new image segmentation technique called strings. A string is a variational deformable model that is learned from a collection of example objects rather than built from a priori analytical or geometrical knowledge. As opposed to existing approaches, an object boundary is represented by a one-dimensional multivariate curve in functional space, a feature function, rather than by a point in vector space. In the learning phase, feature functions are defined by extraction of multiple shape and image features along continuous object boundaries in a given learning set. The feature functions are aligned, then subjected to functional principal components analysis and functional principal regression to summarize the feature space and to model its content, respectively. Also, a Mahalanobis distance model is constructed for evaluation of boundaries in terms of their feature functions, taking into account the natural variations seen in the learning set. In the segmentation phase, an object boundary in a new image is searched for with help of a curve. The curve gives rise to a feature function, a string, that is weighted by the regression model and evaluated by the Mahalanobis model. The curve is deformed in an iterative procedure to produce feature functions with minimal Mahalanobis distance. Strings have been compared with active shape models on 145 vertebra images, showing that strings produce better results when initialized close to the target boundary, and comparable results otherwise.
The push architecture: a prefetching framework for linked data structures
Authors: Chia-Lin Yang
Venue:  (2001)

The widening performance gap between processors and memory makes techniques that alleviate this disparity essential for building high-performance computer systems. Caches are recognized as a cost-effective method to improve memory system performance. However, a cache's effectiveness can be limited if programs have poor locality. Thus techniques that hide memory latency are essential to bridging the CPU-memory gap. Prefetching is a commonly used technique to overlap memory accesses with computation. Prefetching for array-based numeric applications with regular access patterns has been well studied in the past decade. However, prefetching for pointer-intensive applications remains a challenging problem. Prefetching linked data structures (LDS) is difficult because address sequences do not present the same arithmetic regularity as array-based applications and because data dependence of pointer dereferences can serialize the address generation process. The push architecture proposed in this thesis is a cooperative hardware/software prefetching framework designed specifically for linked data structures. The push architecture exploits program structure for future address generation instead of relying on past address history. It identifies the load instructions that traverse a LDS and uses a prefetch engine to execute them ahead of the CPU execution. This allows the prefetch engine to successfully generate future addresses. To overcome the serial nature of LDS address generation, the push architecture employs a novel data movement model. It attaches the prefetch engine to each level of the memory hierarchy and pushes, rather than pulls, data to the CPU. This push model decouples the pointer dereference from the transfer of the current node up to the processor. Thus a series of pointer dereferences becomes a pipelined process rather than a serial process. Simulation results show that the push architecture can reduce up to 100% of memory stall time on a suit of pointer-intensive applications, reducing overall execution time by an average 19%.
A Hybrid Approach to Enhancing the Reliability of Software
Authors: A. M. Frolov
Venue: Programming and Computing Software (2004)

Two approaches to enhancing the reliability and security of software&mdash;static analysis of the source code and dynamic protection&mdash;are compared. Advantages and disadvantages of these approaches are discussed. A hybrid approach to enhancing the reliability of software is suggested that combines advantages of both methods and smoothes over their drawbacks. A classification of dynamic protection systems is presented in terms of the time of their operation, abstraction level at which modifications are introduced and the protection code operates, and principles of protection. A pragmatic approach to the development and evolution of an algorithm for finding errors of a certain class in the source code that result in reducing the reliability or security of the system is described. The algorithm calculates an approximation of the exact solution (the set of dangerous fragments), and every next version of the algorithm improves the approximation to the exact solution. At each stage, the hybrid algorithm is used: when the static analysis cannot decide whether there are errors or not, the task of preventing the effects of possible errors is entrusted to the dynamic protection system. The iterative improvement of the algorithm has two purposes: to reduce the number of false alerts and to reduce the workload on the dynamic protection system. Application of the approach to a class of errors reducing the security of software is considered.
Real-Time Tracking Using Trust-Region Methods
Authors: Tyng-Luh Liu, Hwann-Tzong Chen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--Optimization methods based on iterative schemes can be divided into two classes: line-search methods and trust-region methods. While line-search techniques are commonly found in various vision applications, not much attention is paid to trust-region ones. Motivated by the fact that line-search methods can be considered as special cases of trust-region methods, we propose to establish a trust-region framework for real-time tracking. Our approach is characterized by three key contributions. First, since a trust-region tracking system is more effective, it often yields better performances than the outcomes of other trackers that rely on iterative optimization to perform tracking, e.g., a line-search-based mean-shift tracker. Second, we have formulated a representation model that uses two coupled weighting schemes derived from the covariance ellipse to integrate an object's color probability distribution and edge density information. As a result, the system can address rotation and nonuniform scaling in a continuous space, rather than working on some presumably possible discrete values of rotation angle and scale. Third, the framework is very flexible in that a variety of distance functions can be adapted easily. Experimental results and comparative studies are provided to demonstrate the efficiency of the proposed method.
A study of artificial immune systems applied to anomaly detection
Authors: Fabio Augusto Gonzalez
Venue:  (2003)

The main goal of this research is to examine and to improve the anomaly detection function of artificial immune systems, specifically the negative selection algorithm and other self/non-self recognition techniques. This research investigates different representation schemes for the negative selection and proposes new detector generation algorithms suitable for such representations. Accordingly, different representations are explored: hyper-rectangles (which can be interpreted as rules), fuzzy rules, and hyper-spheres. Four different detector generation algorithms are proposed: Negative Selection with Detection Rules (NSDR, an evolutionary algorithm to generate hypercube detectors), Negative Selection with Fuzzy Detection Rules (NSFDR, an evolutionary algorithm to generate fuzzy-rule detectors), Real-valued Negative Selection (RNS, a heuristic algorithm to generate hyper-spherical detectors), and Randomized Real-valued Negative Selection (RRNS, an algorithm for generating hyper-spherical detectors based on Monte Carlo methods). Also, a hybrid immune learning algorithm, which combines RNS (or RRNS) and classification algorithms is developed. This algorithm allows the application of a supervised learning technique even when samples from only one class (normal) are available. Different experiments are performed with synthetic and real world data from different sources. The experimental results show that the proposed representations along with the proposed algorithms provide some advantages over the binary negative selection algorithm. The most relevant advantages include improved scalability, more expressiveness that allows the extraction of high-level domain knowledge, non-crisp distinction between normal and abnormal, and better performance in anomaly detection.
Profiling and Optimization of Software-Based Network-Analysis Applications
Authors: Loris Degioanni, Mario Baldi, Fulvio Risso, Gianluca Varenni
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

A large set of tools for network monitoring and accounting, security, traffic analysis and prediction ¿ more broadly, for network operation and management ¿ require direct and efficient real-time access to data traveling on the network. Software tools are oftenpreferred because of their low cost and high versatility. However, these tools are often considered to suffer from performance problems on high-speed networks. This paper demonstrates that, despite the common belief, the performance limits for software real-time network analysis tools are still far from being reached and it can even improved with limited hardware support. This work analyzes the performance of a widely used library for network analysis, WinPcap, highlights its bottlenecks, and proposes some solutions that almost double the overall speed, thus enabling the deployment of software-based tools on high speed networks.
Optical solutions for system-level interconnect
Authors: Ian O'Connor
Venue: Proceedings of the 2004 international workshop on System level interconnect prediction (2004)

Throughput, power consumption, signal integrity, pin count and routing complexity are all increasingly important interconnect issues that the system designer must deal with. Recent advances in integrated optical devices may deliver alternative interconnect solutions enabling drastically enhanced performance. This paper begins by outlining some of the more pressing issues in interconnect design, and goes on to describe system-level optical interconnect for inter- and intra-chip applications. Inter-chip optical interconnect, now a relatively mature technology, can enable greater connectivity for parallel computing for example through the use of optical I/O pads and wavelength division multiplexing. Intra-chip optical interconnect, technologically challenging and requiring new design methods, is presented through a proposal for heterogeneous integration of a photonic "above-IC" layer followed by a design methodology for on-chip optical links. Design technology issues are highlighted and the paper concludes with examples of the use of optical links in clock distribution (with quantitative comparisons of dissipated power between electrical and optical clock distribution networks) and for novel network on chip architectures.
Analysis of convergence of an evolutionary algorithm with self-adaptation using a stochastic Lyapunov function
Authors: Mikhail A. Semenov, Dmitri A. Terkel
Venue: Evolutionary Computation (2003)

This paper analyses the convergence of evolutionary algorithms using a technique which is based on a stochastic Lyapunov function and developed within the martingale theory. This technique is used to investigate the convergence of a simple evolutionary algorithm with self-adaptation, which contains two types of parameters: fitness parameters, belonging to the domain of the objective function; and control parameters, responsible for the variation of fitness parameters. Although both parameters mutate randomly and independently, they converge to the "optimum" due to the direct (for fitness parameters) and indirect (for control parameters) selection. We show that the convergence velocity of the evolutionary algorithm with self-adaptation is asymptotically exponential, similar to the velocity of the optimal deterministic algorithm on the class of unimodal functions. Although some martingale inequalities have not be proved analytically, they have been numerically validated with 0.999 confidence using Monte-Carlo simulations.
Signal pattern recognition, hidden markov modeling and traffic flow modeling filters applied in existing signaling of cellular networks for vehicle volume estimation
Authors: Theodore S. Stamoulakatos, Efstathios D. Sykas
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Location Based Services is a new category of services for mobile phone users which is based on mobile phone location. Different techniques have been pro posed for estimating the exact location of mobile phones but existing limitations due to cost, accuracy and network coverage have lead to experimental techniques that appear promising. Such a technique is based on signal load existing in cellular networks. The position estimation is based on the comparison between the prediction of the radio level of the area and the measured uplink and downlink patterns elicited from the received signal level indicator RXLEV. Necessary filtering by Hidden Markov modeling and Road Traffic modeling can result vehicle volume information and thus been able to produce traffic report as a Location Based Service.