ppxscal/embedding_network huggingface dataset:
Functionally-Oriented System Simulation for computer aided design of software/hardware systems
Authors: Gregory M. Scallon, James A. Grupé
Venue: ACM SIGSIM Simulation Digest (1978)

Functionally Oriented System Simulation (FOSS) is applicable to the design and development of real-time computer systems. FOSS assists the system designer by integrating and verifying a model of the system software and hardware in a simulation. With FOSS, vague preliminary concepts can be refined to evolve formal software specifications and derive hardware requirements for a preferred design solution. FOSS incorporates a formal specification language and a translator (pre-processor) to generate a FORTRAN simulation program which includes computer aided design features. An example is included.
The agent visualization system: a graphical and textual representation for multi-agent systems
Authors: Hala Mostafa, Reem Bahgat
Venue: Information Visualization (2005)

As scientists from various domains increasingly resort to agent-based simulation for a more thorough understanding of real-world phenomena, the need for a simulation environment that facilitates rapid development of multi-agent systems is growing. Such a platform should provide means of visualizing the simulated scenario. In this paper we present the agent visualization system, the first system of its kind to specifically focus on catering to the visualization needs of agent-based simulation. The proposed system is a generic add-on that equips a simulation environment with a rich set of visualization facilities offering a variety of textual and graphical browsers that allow the modeler to detect trends and relationships in the simulation scenario. Some techniques from the field of information visualization were adapted and added to the system, while others were devised especially to be used in it. Regardless of their origin, all visualization techniques were thoroughly revised to make them generic enough to fit in our generic system. Agent visualization is more challenging than traditional information visualization in more than one respect. One of them is that the data to be visualized is not static; the simulation system is constantly producing data with every time step. Moreover, the sheer amount of data, together with its diversity, call for special adaptations to ensure that the system remains responsive and generic. To illustrate the various features of the proposed agent visualization system, we present a visualization of MicroTerra; a simulation scenario involving a group of beings trying to maximize their food intake.
On creative engagement with interactive art
Authors: Ernest Edmonds
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

The paper is concerned with the design of interactive art systems intended for display in public locations. It reviews approaches to interactive art systems and discusses the issue of creative engagement with them by the active audience. An approach to elaborating a model of creative engagement is described and exploratory work on its refinement is reported.
Generalizing Cramer's Rule: Solving Uniformly Linear Systems of Equations
Authors: Gema M. Diaz-Toca, Laureano Gonzalez-Vega, Henri Lombardi
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

Following Mulmuley's lemma, this paper presents a generalization of the Moore--Penrose inverse for a matrix over an arbitrary field. This generalization yields a way to uniformly solve linear systems of equations which depend on some parameters.
A Very Low-Power Flash A/D Converter Based on Cmos Inverter Circuit
Authors: Shih-Chang Hsia, Wen-Ching Lee
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

A/D converter (ADC) is a basic device in digital signal processing systems. For high-speed applications, a flash ADC type is often used. Due to require many analog comparators, the chip complexity and power dissipation become very high. Moreover, the accuracy of dividing resistors requires very high for reference voltage if the converting resolution is high. In this study, we develop a new kind of flash ADC based on a simple CMOS circuit. By adjusting the ratio of channel length and width, the transition threshold of the CMOS inverters is various to detect input analog signal. Then their results are encoded to the digital code. The advantages are that the ADC circuit does not need any resistor and use simple CMOS inverters rather than analog comparators. The new 8-bit ADC chip only used 634 transistors. The power dissipates 0.9mW using 0.35um process when it operates at 100MHz.
A New Method of Recognizing Chinese Fonts
Authors: Zhihua Yang, Lihua Yang, Ching Y. Suen
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Chinese fonts are recognized by a new method based on Empirical Mode Decomposition. Five basic strokes have been selected to characterize the features of Chinese fonts. Based on them, stroke feature sequences of a given text block are calculated. Once decomposed by EMD, the first two Intrinsic Mode Functions corresponding to each stroke feature sequence are used to calculate the stroke energy of all the five basic strokes. These energies are combined with the five averages of the residues to produce a tendimensional feature vector. Finally, the minimum distance classifier is used to recognize the fonts. Experiments show encouraging recognition rates.
AReViRoad: a traffic road simulator to learn how to behave
Authors: D. Herviou, E. Maisel
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

Nowadays, traffic road simulators are often dedicated to learn technical gestures in connection with driving. Even if sometimes used to study driver behavior or reaction to a given situation, they don't take into consideration the social dimension of driving. In this way, we propose a traffic road simulator in which learners evolve under constrains defined by a teacher : the aim is to made person learn secure behavior on road. To do so, we axis our research on pedagogical aspect instead of physical simulation aspect. Consequently, we try to create virtual drivers which in interaction generate a credible traffic road from a learner point of view. In this article, we introduce the simulator and the pedagogical choices it implies and also the manner the traffic road is generated.
Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle
Authors: Qian-Ping Gu, Yong Wang
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

The Minimum Congestion Hypergraph Embedding in a Cycle (MCHEC) problem is to embed the hyperedges of a hypergraph as paths in a cycle with the same node set such that the maximum congestion (the maximum number of paths that use any single edge in the cycle) is minimized. The MCHEC problem has many applications, including optimizing communication congestions in computer networks and parallel computing. The problem is NP-hard. In this paper, we give a 1.8-approximation algorithm for the MCHEC problem. This improves the previous 2-approximation results. Our algorithm has the optimal time complexity O(mn) for a hypergraph with m hyperedges and n nodes. We also propose an algorithm which finds an embedding with the optimal congestion L^* for the MCHEC problem in O(n(nL^{*})^{L^{*}}) time. This improves the previous O((mn)^{L^{*}+1}) time algorithm.
Feature selection with a general hybrid algorithm
Authors: Jerffeson Teixeira De Souza
Venue:  (2004)

The Feature Selection problem involves discovering a subset of features, such that a classifier built only with this subset would have better predictive accuracy than a classifier built from the entire set of features. A large number of algorithms have already been proposed for the feature selection problem. Although significantly different with regards to (1) the search strategy they use to determine the right subset of features and (2) how each subset is evaluated, feature selection algorithms are usually classified in three general groups: Filters, Wrappers and Hybrid solutions. In this thesis, we propose a new hybrid system for the problem of feature selection in machine learning. The idea behind this new algorithm, FortalFS, is to extract and combine the best characteristics of filters and wrappers in one algorithm. FortalFS uses results from another feature selection system as a starting point in the search through subsets of features that are evaluated by a machine learning algorithm. With an efficient search heuristic, we can decrease the number of subsets of features to be evaluated by the learning algorithm, consequently decreasing computational effort and still be able to select an accurate subset. We have also designed a variant of the original algorithm in the attempt to work with feature weighting algorithm. In order to evaluate this new algorithm, a number of experiments were run and the results compared to well-known feature selection filter and wrapper algorithms, such as Focus, Relief, LVF, and others. Such experiments were run aver a number of datasets from the UCI Repository. Results showed that FortalFS outperforms most of the algorithms significantly. However, it presents time-consuming performance similar to that of wrappers. Additional experiments using specially designed artificial datasets demonstrated that FortalFS is able to identify and remove both irrelevant, redundant and randomly class-correlated features. The FortalFS time-consumption issue is addressed through parallelism. A parallel version of FortalFS based on the master/slave design pattern is implemented and evaluated. In several experiments, we were able to achieve near optimal speedups.
Installing and Configuring Application Software on the LHC Computing Grid
Authors: Roberto Santinelli, Flavia Donno
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

The management of application software is major scientific and practical challenge for designers of large-scale production Grids The Large Hadron Collider Computing Grid is unique in the sense that coupling between application scientists and the resource providers is extremely loose, thus adding even more complexity to the software management problem. After an analysis of the requirements for a Grid software management service from users' and site administrators' perspective, we give an overview of the solution adopted by the LHC Grid infrastructure to support High Energy Physics experiments, highlighting features and current limitations. Tank&Spark is our server-client solution that extends the LHC Grid application software system and tackles some of its limitations. Tank&Spark can be used as a stand-alone service also in other Grid infrastructures. Here we illustrate the design, deployment and preliminary results obtained.
Planning for disaster with the internet
Authors: Win Treese
Venue: netWorker (2005)

On October 17, 1989, the Loma Prieta earthquake rocked San Francisco, Oakland, and the area known as Silicon Valley. When I heard the news, I was driving home near Boston, and as I soon as I reached my house, I called some friends to see if they were safe.
Deploying the "Internet of Things"
Authors: Robert A. Dolin
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

This paper explores the value in distributing and networking intelligent devices. Value is derived from distributing intelligence to each device locally. Further value is derived from having transparent access to these devices remotely. Extracting this value depends upon overcoming the issues of transparent connectivity, data concentration, and device interoperability. Some examples of successful, valuable applications are offered to illustrate how one might help deploy the "Internet of things."
Herramientas etnogr&aacute;ficas y una variante del muestreo de experiencias para el redise&ntilde;o de la GUI de un cliente de mensajes instant&aacute;neos por internet
Authors: Omar Sosa Tzec, Roberto Holguín Molina
Venue: Proceedings of the 2005 Latin American conference on Human-computer interaction (2005)

Se propone una interfaz gr&aacute;fica de usuario (GUI) de uno de los clientes de mensajes instant&aacute;neos por Internet (IRC) considerando computadoras con pantalla peque&ntilde;a aplic&aacute;ndose dos m&eacute;todos basados en el muestreo de experiencia (ES) [1] para luego realizar con el resultado un ejercicio de b&uacute;squeda de necesidades [2]. Luego, un modelo esquem&aacute;tico-radial se plantea para el proceso de redise&ntilde;o el cual se fundamenta en el paradigma de dise&ntilde;o conocido en ingl&eacute;s como Calm Technology (CT) [3].
Homogenized Virtual Support Vector Machines
Authors: Christian J. Walder, Brian C. Lovell
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

In many domains, reliable a priori knowledge exists that may be used to improve classifier performance. For example in handwritten digit recognition, such a priori knowledge may include classification invariance with respect to image translations and rotations. In this paper, we present a new generalisation of the Support Vector Machine (SVM) that aims to better incorporate this knowledge. The method is an extension of the Virtual SVM, and penalises an approximation of the variance of the decision function across each grouped set of "virtual examples", thus utilising the fact that these groups should ideally be assigned similar class membership probabilities. The method is shown to be an efficient approximation of the invariant SVM of Chapelle and Sch¨olkopf, with the advantage that it can be solved by trivial modification to standard SVM optimization packages and negligible increase in computational complexity when compared with the Virtual SVM. The efficacy of the method is demonstrated on a simple problem.
Delay Aware Adaptive Scheduling inWireless LAN
Authors: Lau-yung Hung, Jun Zhang, Brahim Bensao
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Due to interference and channel fading, wireless environments suffer large and location dependent error rates which greatly degrade the performance of multimedia applications such as video streaming and so. In wireless LAN (WLAN) such errors can be more dramatic and because the physical layer of WLAN implements its own technique to combat these errors - viz., link adaptation techniques such as the well known auto-rate fall-back (ARF) algorithm - the medium access control (MAC)layer throughput of individual stations is limited by that of the station that experiences the worst channel quality. MAC scheduling is one solution to this problem, and extensions of fair queueing policies have been proposed for wireless environments (e.g., [3, 2] and references therein). Most algorithms extend the classic generalized processor sharing algorithm with an opportunistic channel access. Such opportunistic scheduling relies on a channel prediction model in which the channel is assumed to be a two state (good and bad) Markovian channel. Based on future channel states predictions, transmission opportunities are swapped between stations to allow only stations with good channels to transmit. This has a dramatic impact on delay.
The Regularity of the Wave Equation with Partial Dirichlet Control and Colocated Observation
Authors: Bao-Zhu Guo, Xu Zhang
Venue: SIAM Journal on Control and Optimization (2005)

In this paper we analyze a multidimensional controlled wave equation on a bounded domain, subject to partial Dirichlet control and colocated observation. By means of a partial Fourier transform, it is shown that the system is well-posed and regular in the sense of D. Salamon and G. Weiss. The corresponding feedthrough operator is found to be the identity operator on the input space.
Analysis of Fractional Window Recoding Methods and Their Application to Elliptic Curve Cryptosystems
Authors: Katja Schmidt-Samoa, Olivier Semay, Tsuyoshi Takagi
Venue: IEEE Transactions on Computers (2006)

Elliptic curve cryptosystems (ECC) are suitable for memory-constraint devices like smart cards due to their small key-size. A standard way of computing elliptic curve scalar multiplication, the most frequent operation in ECC, is window methods, which enhance the efficiency of the binary method at the expense of some precomputation. The most established window methods are sliding window on NAF (NAF+SW), wNAF, and wMOF, where NAF and MOF are acronyms for nonadjacent form and mutually opposite form, respectively. A common drawback of these schemes is that only a small portion of the numbers are possible sizes for precomputation tables. Therefore, in practice, it is often necessary to waste memory because there is no table fitting exactly the available storage. In the case of wNAF, there exists a variant that allows arbitrary table sizes, the so-called fractional wNAF (Frac--wNAF). In this paper, we give a comprehensive proof using Markov theory for the estimation of the average nonzero density of the Frac-wNAF representation. Then, we propose the fractional wMOF (Frac-wMOF), which is a left-to-right analogue of Frac-wNAF. We prove that Frac-wMOF inherits the outstanding properties of Frac-wNAF. However, because of its left-to-right nature, Frac-wMOF is preferable as it reduces the memory consumption of the scalar multiplication. Finally, we show that the properties of all discussed previous schemes can be achieved as special instances of the Frac-wMOF method. To demonstrate the practicability of Frac-wMOF, we develop an on-the-fly algorithm for computing elliptic curve scalar multiplication with a flexibly chosen amount of memory.
A Fuzzy Vault Scheme
Authors: Ari Juels, Madhu Sudan
Venue: Designs, Codes and Cryptography (2006)

We describe a simple and novel cryptographic construction that we refer to as a fuzzy vault. A player Alice may place a secret value ¿ in a fuzzy vault and "lock" it using a set A of elements from some public universe U. If Bob tries to "unlock" the vault using a set B of similar length, he obtains ¿ only if B is close to A, i.e., only if A and B overlap substantially. In constrast to previous constructions of this flavor, ours possesses the useful feature of order invariance, meaning that the ordering of A and B is immaterial to the functioning of the vault. As we show, our scheme enjoys provable security against a computationally unbounded attacker. Fuzzy vaults have potential application to the problem of protecting data in a number of real-world, error-prone environments. These include systems in which personal information serves to authenticate users for, e.g., the purposes of password recovery, and also to biometric authentication systems, in which readings are inherently noisy as a result of the refractory nature of image capture and processing.
3D Assisted Face Recognition: A Survey of 3D Imaging, Modelling and Recognition Approachest
Authors: J. Kittler, A. Hilton, M. Hamouz, J. Illingworth
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

3D face recognition has lately been attracting ever increasing attention. In this paper we review the full spectrum of 3D face processing technology, from sensing to recognition. The review covers 3D face modelling, 3D to 3D and 3D to 2D registration, 3D based recognition and 3D assisted 2D based recognition. The fusion of 2D and 3D modalities is also addressed. The paper complements other reviews in the face biometrics area by focusing on the sensor technology, and by detailing the efforts in 3D face modelling and 3D assisted 2D face matching.
Challenges in Building a Flat-Bandwidth Memory Hierarchy for a Large-Scale Computer with Proximity Communication
Authors: Robert Drost, Craig Forrest, Bruce Guenin, Ron Ho, Ashok V. Krishnamoorthy, Danny Cohen, John E. Cunningham, Bernard Tourancheau, Arthur Zingher, Alex Chow, Gary Lauterbach, Ivan Sutherland
Venue: Proceedings of the 13th Symposium on High Performance Interconnects (2005)

Memory systems for conventional large-scale computers provide only limited bytes/s of data bandwidth when compared to their flop/s of instruction execution rate. The resulting bottleneck limits the bytes/flop that a processor may access from the full memory footprint of a machine and can hinder overall performance. This paper discusses physical and functional views of memory hierarchies and examines existing ratios of bandwidth to execution rate versus memory capacity (or bytes/flop versus capacity) found in a number of large-scale computers. The paper then explores a set of technologies, Proximity Communication, low-power on-chip networks, dense optical communication, and Sea-of-Anything interconnect, that can flatten this bandwidth hierarchy to relieve the memory bottleneck in a large-scale computer that we call "Hero."
Forecasting Field Defect Rates Using a Combined Time-Based and Metrics-Based Approach: A Case Study of OpenBSD
Authors: Paul Luo Li, Jim Herbsleb, Mary Shaw
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Open source software systems are critical infrastructure for many applications; however, little has been precisely measured about their quality. Forecasting the field defect-occurrence rate over the entire lifespan of a release before deployment for open source software systems may enable informed decision-making. In this paper, we present an empirical case study of ten releases of OpenBSD. We use the novel approach of predicting model parameters of software reliability growth models (SRGMs) using metrics-based modeling methods. We consider three SRGMs, seven metrics-based prediction methods, and two different sets of predictors. Our results show that accurate field defect-occurrence rate forecasts are possible for OpenBSD, as measured by the Theil forecasting statistic. We identify the SRGM that produces the most accurate forecasts and subjectively determine the preferred metrics-based prediction method and set of predictors. Our findings are steps towards managing the risks associated with field defects.
Wiki-templates: adding structure support to wikis on demand
Authors: Anja Haake, Stephan Lukosch, Till Schümmer
Venue: Proceedings of the 2005 international symposium on Wikis (2005)

This paper introduces the concept of wiki templates that allows end-users to determine the structure and appearance of a wiki page. In particular, this better supports editing of structured wiki pages. Wiki templates may be adapted (defined and redefined) by end-users. They may be applied if found helpful, but need not to be used, thus maintaining the simple wiki editing way. In addition, we introduce a methodology to reuse wiki templates among different wiki instances. We show how wiki templates have been successfully used in real-world applications in our CURE wiki engine.
An Automatic Multi-objective Adjustment System for Optical Axes using Genetic Algorithms
Authors: Nobuharu Murata, Tatsumi Furuya, Hirokazu Nosato, Masahiro Murakawa
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

This paper describes an automatic multi-objective adjustment system for optical axes using genetic algorithms. It is difficult for conventional systems to automatically adjust optical axes, because it requires high-precision positioning and angle setting with µm resolution. Moreover, multiple goals that have a trade-off relation must be satis- fied simultaneously by the adjustment. In order to overcome this problem, we propose a multi-objective adjustment system using genetic algorithms. In experiments, simultaneous alignment for the positioning and the angles (parallelism) of optical axes, which is difficult with conventional methods, could be realized within three hours.