ppxscal/embedding_network huggingface dataset:
Performance optimization with propagation delay analysis in WDM networks
Authors: P. A. Baziana, I. E. Pountourakis
Venue: Computer Communications (2007)

In this study we attempt to analyze a synchronous transmission WDMA protocol for passive star topology based on the propagation delay latency effect. The introduction of propagation delay constitutes a serious parameter for WDM networks performance behavior and a realistic basis for the analysis. The proposed WDM network uses a Multi-channel Control Architecture (MCA) for two reasons: First to reduce the electronic processing bottleneck and second to optimize the performance measures by dynamically dividing the control channels into two groups according to the knowledge of the stations status (free or backlogged). In this way we develop a Markovian model for finite population with receiver collisions evaluation.
Graph-Based Analysis of Human Transfer Learning Using a Game Testbed
Authors: Diane J. Cook, Lawrence B. Holder, G. Michael Youngblood
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

The ability to transfer knowledge learned in one environment in order to improve performance in a different environment is one of the hallmarks of human intelligence. Insights into human transfer learning help us to design computer-based agents that can better adapt to new environments without the need for substantial reprogramming. In this paper we study the transfer of knowledge by humans playing various scenarios in a graphically realistic urban setting which are specifically designed to test various levels of transfer. We determine the amount and type of transfer that is being performed based on the performance of human trained and untrained players. In addition, we use a graph-based relational learning algorithm to extract patterns from player graphs. These analyses reveal that indeed humans are transferring knowledge from one set of games to another and the amount and type of transfer varies according to player experience and scenario complexity. The results of this analysis help us understand the nature of human transfer in such environments and shed light on how we might endow computer-based agents with similar capabilities. The game simulator and human data collection also represent a significant testbed in which other AI capabilities can be tested and compared to human performance.
Fast extraction of multi-resolution Gabor features
Authors: Jarmo Ilonen, Joni-Kristian Kamarainen, Heikki Kalviainen
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Gabor filter responses are general purpose features for computer vision and image processing and have been very successful in many application areas, for example in biometric authentication (fingerprint matching, face detection, face recognition and iris recognition). In a typical feature construction, filters are utilised as a multi-resolution structure of several filters tuned to different frequencies and orientations. The multi-resolution structure is similar to wavelets, but the non-orthogonality of Gabor functions implies the main weakness: computational heaviness. The high computational complexity prevents their use in many real-time or near real-time tasks. In this study, an efficient sequential computation method for multi-resolution Gabor features is presented.
The Design for a Secure System Based on Program Analysis
Authors: G. H. MacEwen
Venue: IEEE Transactions on Software Engineering (1983)

This paper describes the design of a prototype experimental secure operating system kernel called xsl that supports compile-time enforcement of an information flow policy. The security model chosen is an extension of Feiertag's model modified to state requirements in terms of program analysis functions. A prototype flow analyzer for Pascal programs, based on Denning's model, has been designed and implemented for incorporation into xs1. In addition, a flow analyzer, based on London's model, has also been designed and implemented. Both kinds of enforcement are supported in xsl. Both program anallyzers use an intermediate code program representation, originally designed for code optimization. Implementation of the flow analyzers is in Euclid with the remainder of xsl in PascaL
Allocating Tasks in Multi-core Processor based Parallel System
Authors: Yi Liu, Xin Zhang, He Li, Depei Qian
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

After a discussion of the task allocation problem in multi-core processor based parallel system, this paper gives the task allocation model, and proposes an iteration-based heuristic algorithm, which is composed of two rounds of operations, in which the processes are assigned to processing nodes in the first round and threads in process are assigned to processor cores in the second round respectively. Each round of operation partitions the Task Interaction Graph by iterations with backtracking. Evaluation result shows that the algorithm can find near-optimal solutions in reasonable time, and behaves better than genetic algorithm when the number of threads increases, since it can find solutions in much less time than genetic algorithm.
A flatness property for filtered D-modules
Authors: Prancisco J. Castro-Jiménez, Michel Granger
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

Let M be a coherent module over the ring Dx of linear differential operators on an analytic manifold X and let Z1, ..., Zk be k> germs of transverse hypersurfaces at a point x ∈ X. The Malgrange-Kashiwara V-filtrations along these hypersurfaces, associated with a given presentation of the germ of M at x, give rise to a multifiltration U•(M) of Mx as in Sabbah's paper [9] and to an analytic standard fan in a way similar to [3]. We prove here that this standard fan is adapted to the multifiltration, in the sense of C. Sabbah. This result completes the proof of the existence of an adapted fan in [9], for which the use of [8] is not possible.
On the 3-distortion of a path
Authors: Pierre Dehornoy
Venue: European Journal of Combinatorics (2008)

We prove that, for embeddings of a path of length n in R^2, the 3-distortion is @W(n^1^/^2), and that, when embedded in R^d, the 3-distortion is O(n^1^/^(^d^-^1^)).
A state-based language for sensor-actuator networks
Authors: Anish Arora, Mohamed Gouda, Jason O. Hallstrom, Ted Herman, William M. Leal, Nigamanth Sridhar
Venue: ACM SIGBED Review (2007)

This paper introduces a language design for sensor-actuator networks. The main features are communication by a soft-state abstraction and behavior control by periodic rule evaluation. These features enable a state-based, rather than event-based, style of programming. Dynamic changes to network configuration and failures of components are automatically handled by this approach. The design choices target applications which experience low-to-moderate rates of sensor input and which do not require extreme, low-latency sensor processing and actuation. Coordinated actuation is concisely expressed in this language.
Tackling car sequencing problems using a generic genetic algorithm
Authors: Terry Warwick, Edward P. K. Tsang
Venue: Evolutionary Computation (1995)

The car sequencing problem (CarSP) was seen as a challenge to artificial intelligence. The CarSP is a version of the job-shop scheduling problem, which is known to be NP-complete. The task in the CarSP is to schedule a given number of cars (of different types) in a sequence to allow the teams in each workstation on the assembly line to fit the required options (e.g. radio, sunroof) on the cars within the capacity of that workstation. In unsolvable problems, one would like to minimize the penalties associated with the violation of the capacity constraints. Previous attempts to tackle the problem either have been unsuccessful or have been restricted to solvable CarSPs only. In this paper, we report on promising results in applying a generic genetic algorithm, which we call GAcSP, to tackle both solvable and unsolvable CarSPs.
Dataflow orchestration of image processing algorithms using high-level petri nets
Authors: Bjorn Wagner, Andreas Dinges, Paul Muller
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

Image processing algorithms for industrial systems tend to be very complex and specialised to the particular case. We present a new way of modeling image-processing algorithms for distributed systems using high level petri-nets. We present the modeling of image-processing as dataflow networks of basic building blocks. Petri nets seem to be well suited for modeling such dataflow networks. We analyse the the usability and limitations of classical petri nets for this task and go on into the required extensions. Furthermore we present our implementation of a distributed service-oriented industrial image-processing system.
Efficient Estimation of Loss Rates in Optical Packet Switched Networks with Wavelength Conversion
Authors: Poul E. Heegaard, Werner Sandmann
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Packet losses can significantly degrade the quality of service (QoS) provided by networks. In this paper, asynchronous bufferless optical packet switched networks with multiple service classes and full wavelength conversion are considered. In case of a large number of wavelengths per fibre, packet losses become rare and thus intractable by means of conventional performance methodologies. We present a novel fast simulation technique for efficiently estimating the loss rates in this setting. Our technique applies Importance Sampling which proceeds by using an alternative probability distribution for accelerated simulation and appropriately weighting the results to obtain unbiased estimators. With our technique the necessary parameters determining the alternative distribution are adaptively obtained by ant colony optimization, a metaheuristic that is in widespread use for solving combinatorial optimization problems. Thereby, no intimate a priori knowledge of the system under consideration is required to set up the simulation. Rather, the parameters adapt to the model. The accuracy and the efficiency of the novel technique are demonstrated by numerical results.
Line Distillation: Increasing Cache Capacity by Filtering Unused Words in Cache Lines
Authors: Moinuddin K. Qureshi, M. Aater Suleman, Yale N. Patt
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

Caches are organized at a line-size granularity to exploit spatial locality. However, when spatial locality is low, many words in the cache line are not used. Unused words occupy cache space but do not contribute to cache hits. Filtering these words can allow the cache to store more cache lines. We show that unused words in a cache line are unlikely to be accessed in the less recent part of the LRU stack. We propose Line Distillation (LDIS), a technique that retains only the used words and evicts the unused words in a cache line. We also propose Distill Cache, a cache organization to utilize the capacity created by LDIS. Our experiments with 16 memory-intensive benchmarks show that LDIS reduces the average misses for a 1MB 8-way L2 cache by 30% and improves the average IPC by 12%.
Power-Laws in a Large Object-Oriented Software System
Authors: Giulio Concas, Michele Marchesi, Sandro Pinna, Nicola Serra
Venue: IEEE Transactions on Software Engineering (2007)

We present a comprehensive study of an implementation of the Smalltalk object oriented system, one of the first and purest object-oriented programming environment, searching for scaling laws in its properties. We study ten system properties, including the distributions of variable and method names, inheritance hierarchies, class and method sizes, system architecture graph. We systematically found Pareto - or sometimes log-normal - distributions in these properties. This denotes that the programming activity, even when modeled from a statistical perspective, can in no way be simply modeled as a random addition of independent increments with finite variance, but exhibits strong organic dependencies on what has been already developed. We compare our results with similar ones obtained for large Java systems, reported in the literature or computed by ourselves for those properties never studied before, showing that the behavior found is similar in all studied object oriented systems. We show how the Yule process is able to stochastically model the generation of several of the power-laws found, identifying the process parameters and comparing theoretical and empirical tail indexes. Lastly, we discuss how the distributions found are related to existing object-oriented metrics, like Chidamber and Kemerer's, and how they could provide a starting point for measuring the quality of a whole system, versus that of single classes. In fact, the usual evaluation of systems based on mean and standard deviation of metrics can be misleading. It is more interesting to measure differences in the shape and coefficients of the data?s statistical distributions.
Graph-Based Semisupervised Learning
Authors: Mark Culp, George Michailidis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

Graph-based learning provides a useful approach for modeling data in classification problems. In this modeling scenario, the relationship between labeled and unlabeled data impacts the construction and performance of classifiers, and therefore a semi-supervised learning framework is adopted. We propose a graph classifier based on kernel smoothing. A regularization framework is also introduced, and it is shown that the proposed classifier optimizes certain loss functions. Its performance is assessed on several synthetic and real benchmark data sets with good results, especially in settings where only a small fraction of the data are labeled.
Study on Blind Equalization Algorithm Based on SOS
Authors: Ju-min Zhao, Deng-ao Li, Hua-kui Wang, Li-yi Zhang, Jing Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper proposed a new blind equalization algorithm based on Cyclostationarity. Firstly analyzed the received signal processed by fractional sample, and then presented the novel algorithm based on second order statisticsSOSand MMSE criterion. The advantage of this algorithm is less complexity than the traditional algorithms, and it's antinoise performance is better than the traditional equalizer based zero-force criterion.
3D game content distributed adaptation in heterogeneous environments
Authors: Francisco Morán, Marius Preda, Gauthier Lafruit, Paulo Villegas, Robert-Paul Berretty
Venue: EURASIP Journal on Advances in Signal Processing (2007)

Most current multiplayer 3D games can only be played on a single dedicated platform (a particular computer, console, or cell phone), requiring specifically designed content and communication over a predefined network. Below we show how, by using signal processing techniques such as multiresolution representation and scalable coding for all the components of a 3D graphics object (geometry, texture, and animation), we enable online dynamic content adaptation, and thus delivery of the same content over heterogeneous networks to terminals with very different profiles, and its rendering on them. We present quantitative results demonstrating how the best displayed quality versus computational complexity versus bandwidth tradeoffs have been achieved, given the distributed resources available over the end-to-end content delivery chain. Additionally, we use state-of-the-art, standardised content representation and compression formats (MPEG-4 AFX, JPEG 2000, XML), enabling deployment over existing infrastructure, while keeping hooks to well-established practices in the game industry.
Legible Cities: Focus-Dependent Multi-Resolution Visualization of Urban Relationships
Authors: Remco Chang, Ginette Wessel, Robert Kosara, Eric Sauda, William Ribarsky
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Numerous systems have been developed to display large collections of data for urban contexts; however, most have focused on layering of single dimensions of data and manual calculations to understand relationships within the urban environment. Furthermore, these systems often limit the userâs perspectives on the data, thereby diminishing the userâs spatial understanding of the viewing region. In this paper, we introduce a highly interactive urban visualization tool that provides intuitive understanding of the urban data. Our system utilizes an aggregation method that combines buildings and city blocks into legible clusters, thus providing continuous levels of abstraction while preserving the userâs mental model of the city. In conjunction with a 3D view of the urban model, a separate but integrated information visualization view displays multiple disparate dimensions of the urban data, allowing the user to understand the urban environment both spatially and cognitively in one glance. For our evaluation, expert users from various backgrounds viewed a real city model with census data and confirmed that our system allowed them to gain more intuitive and deeper understanding of the urban model from different perspectives and levels of abstraction than existing commercial urban visualization systems.
Compilation of Nonprocedural Specifications into Computer Programs
Authors: N. S. Prywes
Venue: IEEE Transactions on Software Engineering (1983)

The paper describes the compilation of a program specification, written in the very high level nonprocedural MODEL language, into an object, PL/1 or Cobol, procedural language program. Nonprocedural programming languages are descriptive and devoid of procedural controls. They are therefore easier to use and require less programming skills than procedural languages. The MODEL language is briefly presented and illustrated followed by a description of the compilation process. An important early phase in the compilation is the representation of the specification by a dependency graph, denoted as array graph, which expresses the data flow interdependencies between statements. Two classes of algorithms which utilize this graph are next described. The first class checks various completeness, nonambiguity, and consistency aspects of the specification. Upon detecting any problems, the system attempts some automatic correcting measures which are reported to the user, or alternately, when no corrections appear as reasonable, it reports the error and solicits a modification from the user. The second class of algorithms produces an intermediate design of an object program in a language independent form. Finally, PL/1 or Cobol code is generated.
Special Feature: Fault Diagnosis of Microprocessor Systems
Authors: V. P. Srini
Venue: Computer (1977)

The rapid growth in numbers of microprocessor-based intelligent terminals e.g., POS terminals, communication preprocessors, and I/O processors for large computer systems has brought with it increased awareness of the importance of guaranteeing the correct operation of the microprocessor without disturbing the use of the system. This in turn has focused attention on fault detection, location, and repair in such systems.
Exposing cross-domain resources for researchers and learners
Authors: Ann Apps, Ross MacIntyre, Leigh Morris
Venue: Proceedings of the 2002 international conference on Dublin core and metadata applications: Metadata for e-communities: supporting diversity and convergence (2002)

MIMAS is a national UK data centre which provides networked access to resources to support learning and research across a wide range of disciplines. There was no consistent way of discovering information within this cross-domain, heterogeneous collection of resources, some of which are access restricted. Further these resources must provide the interoperable interfaces required within the UK higher and further education 'information environment'. To address both of these problems, consistent, high quality metadata records for the MIMAS services and collections have been created, based on Dublin Core, XML and standard classification schemes. The XML metadata repository, or 'metadatabase', provides World Wide Web, Z39.50 and Open Archives Initiative interfaces. In addition, a collection level database has been created with records based on the RSLP Collection Level Description schema. The MIMAS Metadatabase, which is freely available, provides a single point of access into the disparate, cross-domain MIMAS datasets and services.
The case for power with test
Authors: T. M. Mak
Venue: IEEE Design Test (2007)

In the past few years, many researchers have claimed that power issues in test applications are primarily due to scan shifting. The author of this column explains why this conclusion is simply not realistic.
Low-latency scheduling in large switches
Authors: Wladek Olesinski, Nils Gura, Hans Eberle, Andres Mejia
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

Scheduling in large switches is challenging. Arbiters must operate at high rates to keep up with the high switching rates demanded by multi-gigabit-per-second link rates and short cells. Low-latency requirements of some applications also challenge the design of schedulers. In this paper, we propose the Parallel Wrapped Wave Front Arbiter with Fast Scheduler (PWWFA-FS). We analyze its performance, present simulation results, discuss its implementation, and show how this scheme can provide low latency under light load while scaling to large switches with multi-terabit-per-second throughput and hundreds of ports.
Extended rank analysis of covariance adjusting for local correlations
Authors: Chu-Chih Chen
Venue: Computational Statistics Data Analysis (2008)

An implicit assumption in the classical analysis of covariance is that the relationship between the response variable Y and the covariable X is consistent across the support of X. This may not hold in general if the strength of the relationship between Y and X varies in different regions of the covariate space [Doksum, K., Blyth, S., Bradlow, E., Meng, X.-L., Zhao, H., 1994. Correlation curves as local measures of variance explained by regression. J. Amer. Statist. Assoc. 89 (426), 571-582]. In this paper, to cope with heterocorrelaticity nonparametrically, we propose an extended rank analysis of covariance by adjusting local tolerances and dividing the support of X into disjoint subintervals with substantial different correlations between Y and X. The results showed that the proposed method was flexible in model error distributions as well as changing local correlations between Y and X, while retaining relatively well empirical power in simulations.