ppxscal/embedding_network huggingface dataset:
A scalable multicast protocol with QoS guaranties
Authors: Abderrahim Benslimane, Omar Moussaoui
Venue: Network control and engineering for Qos, security and mobility II (2003)

The technological advances in communication networks and computers are largely contributed to the developments of multimedia applications such as the videoconference. These applications require an efficient management of the Quality of Service (QoS) and consist of a great number of participants. In order to support such applications, we propose a hierarchical communication architecture and multicast protocols allowing scalability. This architecture allows to guarantee QoS requirements. In fact, it allows to reduce efficiently the connection number and the communication delays. We use simulation to analyze and compare the performances of the proposed multicast protocols to the direct architecture. Simulation results confirm our purposes that are the reduction of the network charge and the average delay.
Extending the theory of Owicki and Gries with asynchronous message passing
Authors: Doug Goldson
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

This paper describes an extension of the theory ofOwicki and Gries to a programming language that supportsasynchronous message passing based on unconditional sendactions and conditional receive actions. The focus is on exploringthe fitness of the extension for distributed program derivation. Anumber of experiments are reported, based on a running exampleproblem, and with the aim of exploring design heuristics and ofstreamlining derivations and progress arguments.
Optimization of a language for data mining
Authors: Rosa Meo
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Constraint-based mining has attracted in recent years the interest of the data mining research community because it increases the relevance of the result set, reduces its volume and the amount of workload. However, constrained-based mining will be completely feasible only when efficient optimizers for mining languages will be available.This paper is a first step towards the construction of optimizers for a constraint-based mining language. It provides the guidelines for the comparison of classes of statements by means of the relationships existing between their result sets. Furthermore it identifies as useful information to the optimization the presence of unique constraints and functional dependencies in the schema of the database. We show the practical implications of the discussed principles with a set of algorithms designed for a specific mining language. These algorithms use also a new designed index, called mining index that allows to reduce the portion of the database to be read in response to some classes of queries. In these cases the workload of the mining engine is greatly reduced or completely avoided in a significant subset of the cases.
Developing principles of GUI programming using views
Authors: Judith Bishop, Nigel Horspool
Venue: ACM SIGCSE Bulletin (2004)

This paper proposes that GUI development is as important as other aspects of programming, such as a sound understanding of control structures and object orientation. Far less attention has been paid to the programming structures for GUIs and certainly there are few cross language principles to aid the programmer. We propose that principles of GUIs can be extracted and learnt, and that they do enhance good programming practice. These principles have been implemented in our Views system which features an XML-based GUI description notation coupled with an engine that shields the programmer from much of the intricate complexity associated with events, listeners and handlers. The system is programmed primarily in C# for .NET, but is available in various forms for Java and for other platforms which support .NET through the SSCLI.
Verifying CIM Models of Apache Web-Server Configurations
Authors: Carsten Sinz, Amir Khosravizadeh, Wolfgang Küchlin, Viktor Mihajlovski
Venue: Proceedings of the Third International Conference on Quality Software (2003)

We show how configuration properties of the ApacheWeb-server can be formally verified, so that an installationis safe with respect to both universal and site specific localconstraints. Our approach starts from an existing semi-formalcomponent model of the Web-server in the CommonInformation Model (CIM) standard. Hence our approach isapplicable also to the verification of other systems for whicha CIM model exists.
Network-centric migration of embedded control software: a case study
Authors: Phillip de Souza, Andrew McNair, Jens H. Jahnke
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

Over the last two decades, microcontrollers have replaced conventional electronics in the control of most mechatronic devices in use today. Recently, we have seen the beginning of a new technological movement that aims towards using the Internet for integrating embedded devices to form pervasive computing infrastructures. Smart Spaces, tele-control and Business-To-Machine (B2M) eCommerce are among the emerging technologies currently under research and development.In a collaborative project with industry and the Herzberg Institute of Astrophysics, we have investigated tools and techniques that aid the migration of existing embedded control software to such network-centric environments. The goal is to be able to inexpensively leverage existing products to modern applications rather than having to re-implement highly specialized embedded programs.This paper reports on our experiences with a case study on migrating a real-world micro-controller application to a networked infrastructure. Based on our experiences, we propose a method that would help practitioners tackle similar reengineering projects.
Algorithm development, simulation analysis and parametric studies for data allocation in distributed database systems
Authors: Amita Goyal Chin
Venue: Advanced topics in database research vol. 1 (2003)

In a distributed database system, an increase in workload typically necessitates the installation of additional database servers followed by the implementation of expensive data reorganization strategies. We present the Partial REALLOCATE and Full REALLOCATE heuristics for efficient data reallocation. Complexity is controlled and cost minimized by allowing only incremental introduction of servers into the distributed database system. Using first simple examples and then, a simulator, our framework for incremental growth and data reallocation in distributed database systems is shown to produce near optimal solutions when compared with exhaustive methods.
Building Quality-of-Service Monitoring Systems for Traffic Engineering and Service Management
Authors: Abolghasem "Hamid" Asgari, Panos Trimintzios, Mark Irons, Richard Egan, George Pavlou
Venue: Journal of Network and Systems Management (2003)

Deployment of quality-of-service (QoS) based value-added services in IP networks necessitates the use of traffic engineering. Traffic engineering allows service providers to use the network resources efficiently, according to the different quality levels associated with the range of services they offer. Traffic engineering relies typically on monitoring data for both &ldquo;offline proactive&rdquo; and &ldquo;dynamic reactive&rdquo; approaches. Monitoring data may be used for network provisioning, dynamic resource allocation, route management, and in-service performance verification for value-added IP services. A monitoring system should scale with the network size, the network speed, and the number of customers subscribed to use value-added IP services. This paper investigates the requirements of scalable monitoring system architectures, proposes principles for designing such systems and validates these principles through the design and implementation of a scalable monitoring system for traffic engineering and QoS delivery in IP Differentiated Services networks. Methods for assessing the relative merits of such monitoring systems are proposed. Experimental assessment results prove the scalability, accuracy, and also demonstrate the benefits of the proposed monitoring system.
Increasing the number of effective registers in a low-power processor using a windowed register file
Authors: Rajiv A. Ravindran, Robert M. Senger, Eric D. Marsman, Ganesh S. Dasika, Matthew R. Guthaus, Scott A. Mahlke, Richard B. Brown
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

Low-power embedded processors utilize compact instruction encodings to achieve small code size. Instruction sizes of 8 to 16 bits are common. Such encodings place tight restrictions on the number of bits available to encode operand specifiers, and thus on the number of architected registers. The central problem with this approach is that performance and power are often sacrificed as the burden of operand supply is shifted from the register file to the memory due to the limited number of registers. In this paper, we investigate the use of a windowed register file to address this problem by providing more registers than allowed in the encoding. The registers are organized as a set of identical register windows where at each point in the execution there is a single active window. Special window management instructions are used to change the active window and to transfer values between windows. The goal of this design is to give the appearance of a large register file without compromising the instruction encoding. To support the windowed register file, we designed and implemented a novel graph partitioning based compiler algorithm that partitions virtual registers within a given procedure across multiple windows. On a 16-bit embedded processor with a parameterized register window, an average of 10% improvement in application performance and 7% reduction in system power was achieved as an eight-register design was scaled from one to four windows.
The rhetorical parsing of unrestricted texts: a surface-based approach
Authors: Daniel Marcu
Venue: Computational Linguistics (2000)

Coherent texts are not just simple sequences of clauses and sentences, but rather complex artifacts that have highly elaborate rhetorical structure. This paper explores the extent to which well-formed rhetorical structures can be automatically derived by means of surface-form-based algorithms. These algorithms identify discourse usages of cue phrases and break sentences into clauses, hypothesize rhetorical relations that hold among textual units, and produce valid rhetorical structure trees for unrestricted natural language texts. The algorithms are empirically grounded in a corpus analysis of cue phrases and rely on a first-order formalization of rhetorical structure trees.The algorithms are evaluated both intrinsically and extrinsically. The intrinsic evaluation assesses the resemblance between automatically and manually constructed rhetorical structure trees. The extrinsic evaluation shows that automatically derived rhetorical structures can be successfully exploited in the context of text summarization.
Translation analysis and translation automation
Authors: Pierre Isabelle, Marc Dymetman, George Foster, Jean-Marc Jutras, Elliott Macklovitch, Francois Perrault, Xiaobo Ren, Michel Simard
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

We argue that the concept of translation analysis provides a suitable foundation for a new generation of translation support tools. We show that pre-existing translations can be analyzed into a structured translation memory and describe our TransSearch bilingual concordancing system, which allows translators to harness such a memory. We claim that translation analyzers can help detect translation errors in draft translations and we present the results of an experiment on the detection of deceptive cognates conducted as part of our TransCheck project. Finally, we claim that translation analysis can facilitate the speech-to-text transcription of dictated translations and introduce our new TransTalk project.
In situ high temperature synchrotron-radiation diffraction studies of silicidation processes in nanoscale Ni layers
Authors: J. Rinderknecht, H. Prinz, T. Kammler, N. Schell, E. Zschech, K. Wetzig, T. Gessner
Venue: Microelectronic Engineering (2003)

The formation of nickel silicides has been studied by X-ray diffraction experiments using synchrotron radiation (SR). A high temperature chamber was used to investigate the phase formation and transition processes under quasi-static conditions at temperatures from 200 to 650°C. Samples with different dopants, several metal layer thicknesses as well as samples with and without a 150 Å TiN capping layer on single-crystal (001) and polycrystalline silicon substrates were examined. While n-type dopants like P and As had no significant impact on the silicidation processes, boron decreased the range of thermal stability of the low-resistivity phase NiSi. A TiN capping layer shifts both these formation and transition temperatures to higher values.
Enforce POLA on processes to control viruses
Authors: Alan H. Karp
Venue: Communications of the ACM (2003)

Applying the Principle of Least Authority on processes, instead of just on people, limits damage from viruses and worms.
Using a threshold function to determine the status of lymphocytes in the artificial immune system
Authors: A. J. Graaff, A. P. Engelbrecht
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

The artificial immune system (AIS) can be seen as a pattern recognition system. The AIS consists of artificial lymphocytes (ALC) that classify any pattern either as part of a predetermined set of patterns or not. It is possible for an ALC to classify more than one pattern and even classify a pattern better than other ALCs. The ALCs that never classify any pattern need to be replaced by newly created ALCs. It is therefore important to know what ALCs need to be replaced so that ALCs with a better classification are kept. This paper proposes a threshold function to determine which ALCs need to be replaced.
An Empirical Validation of Object-Oriented Metrics in Two Different Iterative Software Processes
Authors: Mohammad Alshayeb, Wei Li
Venue: IEEE Transactions on Software Engineering (2003)

Object-oriented (OO) metrics are used mainly to predict software engineering activities/efforts such as maintenance effort, error proneness, and error rate. There have been discussions about the effectiveness of metrics in different contexts. In this paper, we present an empirical study of OO metrics in two iterative processes: the short-cycled agile process and the long-cycled framework evolution process. We find that OO metrics are effective in predicting design efforts and source lines of code added, changed, and deleted in the short-cycled agile process and ineffective in predicting the same aspects in the long-cycled framework process. This leads us to believe that OO metrics' predictive capability is limited to the design and implementation changes during the development iterations, not the long-term evolution of an established system in different releases.
Predicting Forest Age Classes from High Spatial Resolution Remotely Sensed Imagery Using Voronoi Polygon Aggregation
Authors: Trisalyn Nelson, Barry Boots, Mike Wulder, Rob Feick
Venue: Geoinformatica (2004)

Efficient identification of forest age is useful for forest management and ecological applications. Here we propose a user-assisted method for determining forest age using high spatial resolution remotely sensed imagery. This method requires individual trees to be extracted from imagery and represented as points. We use a local maximum filter to generate points that are converted to Voronoi polygons. Properties of the Voronoi polygons are correlated with forest age and used to aggregate points (trees) into areas (stands) based on three forest age classes. Accuracy of the aggregation ranges from approximately 68% to 78% and identification of the mature class is more consistent and accurate than the younger classes.
Misep—linear and nonlinear ICA based on mutual information
Authors: Luís B. Almeida
Venue: The Journal of Machine Learning Research (2003)

Linear Independent Components Analysis (ICA) has become an important signal processing and data analysis technique, the typical application being blind source separation in a wide range of signals, such as biomedical, acoustical and astrophysical ones. Nonlinear ICA is less developed, but has the potential to become at least as powerful.This paper presents MISEP, an ICA technique for linear and nonlinear mixtures, which is based on the minimization of the mutual information of the estimated components. MISEP is a generalization of the popular INFOMAX technique, which is extended in two ways: (1) to deal with nonlinear mixtures, and (2) to be able to adapt to the actual statistical distributions of the sources, by dynamically estimating the nonlinearities to be used at the outputs. The resulting MISEP method optimizes a network with a specialized architecture, with a single objective function: the output entropy.The paper also briefly discusses the issue of nonlinear source separation. Examples of linear and nonlinear source separation performed by MISEP are presented.
Automatic generation of application specific processors
Authors: David Goodwin, Darin Petkov
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

An application-specific instruction-set processor (ASIP) is ideally suited for embedded applications that have demanding performance, size, and power requirements that cannot be satisfied by a general purpose processor. ASIPs also have time-to-market and programmability advantages when compared to custom ASICs. The AutoTIE system simplifies the creation of ASIPs by automatically enhancing a base processor with application specific instruction set architecture (ISA) extensions, including instructions, operations, and register files. The new instructions, operations, and register files are automatically recognized and exploited by the entire software tool chain, including the C/C++ compiler. Thus, taking advantage of the generated ASIP does not require any changes to the application or any assembly language coding. AutoTIE uses the C/C++ compiler to analyze an application, and based on the analysis generates thousands, or even millions, of possible ISA extensions for the application. AutoTIE then uses performance and hardware estimation techniques to combine the ISA extensions into a large number of potential ASIPs, and for a range of hardware costs, chooses the ASIP that provides the maximum performance improvement. For example, for an application performing a radix-4 FFT, AutoTIE considers over 34,000 potential sets of ISA extensions. For hardware costs ranging from 7800 gates to 128,000 gates, AutoTIE combines these extensions to form 31 ASIPs, which provide performance improvements ranging from a factor of 1.12 to a factor of 11.3 compared to a general-purpose processor.
An Integrated Design Approach for Self-Checking FPGAs
Authors: C. Bolchini, F. Salice, D. Sciuto, R. Zavaglia
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper proposes a methodology for designing FPGAs able to self-detect the occurrence of hardware failures, integrated in a standard, industrial design .ow. The approach improves the results proposed in the past, by de.ning a testing environment which takes into account the peculiarities of FPGA platforms.
Regression Simulation: Applying Path-Based Learning In Delay Test and Post-Silicon Validation
Authors: Li-C. Wang
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents a novel path-based learning methodology to achieve timing Regression Simulation. The methodology can be applied for two purposes: (1) In pre-silicon phase, regression simulation can be used to produce a fast and approximate timing simulator to avoid the high cost associated with statistical timing simulation. (2) In post-silicon phase, regression simulation can be used as a vehicle to deduce critical paths from the pass/fail behavior observed on the test chips. Our path-based learning methodology consists of four major components: a delay test pattern set, a logic simulator, a set of selected paths as the basis for learning, and a machine learner. We summarize the key concepts in our regression simulation approach and present experimental results.
Interactive Visualization and Navigation in Large Data Collections using the Hyperbolic Space
Authors: Jörg Walter, Jörg Ontrup, Daniel Wessling, Helge Ritter
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We propose the combination of two recently introducedmethods for the interactive visual data mining of largecollections of data. Both, Hyperbolic Multi-DimensionalScaling (HMDS) and Hyperbolic Self-Organizing Maps(HSOM) employ the extraordinary advantages of the hyperbolicplane (H2): (i) the underlying space grows exponentiallywith its radius around each point - ideal for embeddinghigh-dimensional (or hierarchical) data; (ii) thePoincaré model of the IH2 exhibits a fish-eye perspectivewith a focus area and a context preserving surrounding; (iii)the mouse binding of focus-transfer allows intuitive interactivenavigation.The HMDS approach extends multi-dimensional scalingand generates a spatial embedding of the data representingtheir dissimilarity structure as faithfully as possible. Itis very suitable for interactive browsing of data object collections,but calls for batch precomputation for larger collectionsizes.The HSOM is an extension of Kohonen's Self-OrganizingMap and generates a partitioning of the data collection assignedto an IH2 tessellating grid. While the algorithm'scomplexity is linear in the collection size, the data browsingis rigidly bound to the underlying grid.By integrating the two approaches we gain the synergetic effectof adding advantages of both. And the hybrid architectureuses consistently the IH2 visualization and navigationconcept. We present the successfully application to a textmining example involving the Reuters-21578 text corpus.
Quick-release Fair Scheduling
Authors: James H. Anderson, Aaron Block, Anand Srinivasan
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

In prior work on multiprocessor fairness, ef£cient techniqueswith provable properties for reallocating spare processingcapacity have been elusive. In this paper, weaddress this shortcoming by proposing a new notion ofmultiprocessor fairness, called quick-release fair (QRfairscheduling. Under QRfair scheduling, each task is speci£ed by giving both a minimum and a maximum weight (i.e., processor share. The goal is to schedule each task (as thespare capacity changes at a rate that is (i) at least that impliedby its minimum weight and (ii) at most that implied byits maximum weight. We present a quick-release variant ofthe PD2 Pfair scheduling algorithm called PDQ and provethat the allocations of PDQ always satisfy (i and (ii . Also,we present results from simulation experiments that showthe ef£cacy of PDQ.