ppxscal/embedding_network huggingface dataset:
Synthesis techniques for application-specific processor-based design
Authors: Jason Cong
Venue:  (2007)

The relentless tracking of Moore's law has led to exponentially increasing transistor counts and results in an explosive growth potential in functionality and the amount of computing power available on a single chip. However, the traditional methods for application-specific integrated circuit (ASIC) design are incapable of handling the increasing design complexity and design challenges. System-level design has been identified as the next productivity boost for the semiconductor industry. At the system-level design, the programmable platforms that are rapidly emerging have become an attractive design alterative to ASIC:s. In this dissertation, we focus on application-specific processor-based platform synthesis, where the primary building blocks are processor cores which can be general-purpose microprocessors, DSP cores and application-specific coprocessors. The platform can be adapted for specific applications by customizing the processor cores, memory elements, their communications, and the application mapping solutions. Effectively, we are extending the standard cell-based methodology for ASIC designs to the application-specific processor-based design methodology. In the first part of the thesis, we focus on synthesis techniques for application-specific instruction set processors. We present a complete synthesis flow and concsponding novel algorithms. We also examine the data bandwidth problem and present a quantitative analysis of the performance degradation due to the data bandwidth limitation. An architectural extension and interesting register binding algorithm have been proposed to address the issue. In the second part of the thesis, we investigate techniques for synthesizing application-specific processor networks (ASPNs). First, novel algorithms have been proposed to map task graphs of stream-oriented applications to homogeneous ASPNs so that the throughput and latency can be optimized simultaneously. Next, we study the heterogeneous ASPNs synthesis problem for reconfigurable high-performance computing. Efficient job scheduling and accelerator selection algorithms have been proposed to achieve the optimal system performance.
Action evaluation for mobile robot global localization in cooperative environments
Authors: Andreu Corominas Murtra, Josep M. Mirats Tur, Alberto Sanfeliu
Venue: Robotics and Autonomous Systems (2008)

This work is about solving the global localization issue for mobile robots, operating in large and cooperative environments. It tackles the problem of estimating the pose of a robot, or team of robots in a map reference frame, given the map, the real-time data from the robot onboard sensors, and the real-time data coming from other robots or sensors in the environment. After a first step of position hypotheses generation, an efficient probabilistic active strategy selects an action, for a single lost robot case, or two joint actions when two lost robots are in a line of sight, so that the hypotheses set is best disambiguated. The action set is adapted to the multi-hypothesis situation, and action evaluation takes into account remote observations available in robot network systems. This paper presents the theoretical formulation for both non-cooperative, and cooperative cases. An implementation of the proposed strategy is discussed, and simulation results presented.
Speech Signal Processing Based on Wavelets and SVM for Vocal Tract Pathology Detection
Authors: P. Kukharchik, I. Kheidorov, E. Bovbel, D. Ladeev
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

This paper investigates the adaptation of modified wavelet-based features and support vector machines for vocal folds pathology detection. A new type of feature vector, based on continuous wavelet transform of input audio data is proposed for this task. Support vector machine was used as a classifier for testing the feature extraction procedure. The results of the experimental study are shown.
BitDew: a programmable environment for large-scale data management and distribution
Authors: Gilles Fedak, Haiwu He, Franck Cappello
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Desktop Grids use the computing, network and storage resources from idle desktop PC's distributed over multiple-LAN's or the Internet to compute a large variety of resource-demanding distributed applications. While these applications need to access, compute, store and circulate large volumes of data, little attention has been paid to data management in such large-scale, dynamic, heterogeneous, volatile and highly distributed Grids. In most cases, data management relies on ad-hoc solutions, and providing a general approach is still a challenging issue. To address this problem, we propose the BitDew framework, a programmable environment for automatic and transparent data management on computational Desktop Grids. This paper describes the BitDew programming interface, its architecture, and the performance evaluation of its runtime components. BitDew relies on a specific set of meta-data to drive key data management operations, namely life cycle, distribution, placement, replication and fault-tolerance with a high level of abstraction. The Bitdew runtime environment is a flexible distributed service architecture that integrates modular P2P components such as DHT's for a distributed data catalog and collaborative transport protocols for data distribution. Through several examples, we describe how application programmers and Bitdew users can exploit Bitdew's features. The performance evaluation demonstrates that the high level of abstraction and transparency is obtained with a reasonable overhead, while offering the benefit of scalability, performance and fault tolerance with little programming cost.
Report on the Third Contest on Symbol Recognition
Authors: Ernest Valveny, Philippe Dosch, Alicia Fornés, Sergio Escalera
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

In this paper we make a brief report of the third edition of the International Symbol Recognition Contest, organized in the context of GREC'07. This contest follows the series started at the GREC'03 workshop. In this report we describe the main changes introduced in the test data according to the conclusions of the past edition of the contest. We also summarize the results obtained by the only participant method. Finally, we point out some conclusions and open issues to be addressed in the next editions of the contest.
QoS-Oriented Packet Scheduling for Wireless Multimedia CDMA Communications
Authors: Vincent Huang Weihua Zhuang
Venue: IEEE Transactions on Mobile Computing (2004)

In the third-generation (and beyond) wireless communication systems, there will be a mixture of different traffic classes, each having its own transmission rate characteristics and quality-of-service (QoS) requirements. In this paper, a QoS-oriented medium access control (MAC) protocol with fair packet loss sharing (FPLS) scheduling is proposed for wireless code-division multiple access (CDMA) communications. The QoS parameters under consideration are the transmission bit error rate (BER), packet loss, and delay requirements. The MAC protocol exploits both time-division and code-division statistical multiplexing. The BER requirements are guaranteed by properly arranging simultaneous packet transmissions and controlling their transmit power levels, whereas the packet loss and delay requirements are guaranteed by proper packet scheduling. The basic idea of FPLS is to schedule the transmission of multimedia packets in such a way that all the users have a fair share of packet loss according to their QoS requirements, which maximizes the number of the served users under the QoS constraints. Simulation results demonstrate effectiveness of the FPLS scheduler, in comparison with other previously proposed scheduling algorithms.
Technical and Fundamental Analysis for the Forecast of Financial Scrip Quotation: An Approach Employing Artificial Neural Networks and Wavelet Transform
Authors: Anderson Silva Soares, Maria Stela Veludo De Paiva, Clarimar José Coelho
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

This paper presents a method for predicting nonlinear time series. It is based on the multiscale filtering, fundamental and technical model and artificial neural networks. In the technical model we used wavelet transform for disjoin the time series trends then to smooth the economic time series by multiscale filtering. We used too the fundamental analysis, that is, financial and macroeconomics variables to improve the network forecasting. The results were compared with the technical analysis showing that the multiscale filtering and addition of the fundamental variables increase the network forecasting ability.
Comparing Topic Maps Constraint Specification Languages
Authors: Giovani Rubert Librelotto, Renato Preigschadt Azevedo, José Carlos Ramalho, Pedro Rangel Henriques
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

Topic Map Constraint Language (TMCL) provides a means to express constraints on topic maps conforming to ISO/IEC 13250. In this article, we will use a test suite and show, step-by-step, the way we handled several kinds of Topic Maps constraints in many different instances in order to answer questions like: Do they do the same job? Are there some kinds of Topic Maps constraints that are easier to specify with one of them? Do you need different background to use the tools? Is it possible to use them in similar situations (the same topic maps instances)? May we use them to produce an equal result? How do AsTMa!, OSL, Toma, and XTche relate to Topic Maps Constraint Language (TMCL)? What kind of constraints each one of these three can not specify? We will conclude this paper with a summary of the comparisons accomplished between those Topic Maps constraint languages over the use case proposed.
The Deterministic Dendritic Cell Algorithm
Authors: Julie Greensmith, Uwe Aickelin
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

The Dendritic Cell Algorithm is an immune-inspired algorithm originally based on the function of natural dendritic cells. The original instantiation of the algorithm is a highly stochastic algorithm. While the performance of the algorithm is good when applied to large real-time datasets, it is difficult to analyse due to the number of random-based elements. In this paper a deterministic version of the algorithm is proposed, implemented and tested using a port scan dataset to provide a controllable system. This version consists of a controllable amount of parameters, which are experimented with in this paper. In addition the effects are examined of the use of time windows and variation on the number of cells, both which are shown to influence the algorithm. Finally a novel metric for the assessment of the algorithms output is introduced and proves to be a more sensitive metric than the metric used with the original Dendritic Cell Algorithm.
Scheduling for Combining Traffic of On-Chip Trace Data in Embedded Multi-core Processor
Authors: Xiao Hu, Pengyong Ma, Shuming Chen
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

On-chip trace data contains run-time information of embedded multi-core processors for software debug. Trace data are transferred through special data path and output pins. Scheduling for combining the traffic of multi-source trace data is one of key issues that affect performance of the on-chip trace system. By analyzing features of trace traffic combination, a lazy scheduling algorithm based on the service threshold and the minimum service granularity is proposed. The queue length distribution is constrained by configurable service threshold of each queue, and switching overheads are reduced by lazy scheduling and configurable minimum service granularity. Two metrics of buffer utilizations on overflowing are presented to evaluate the efficacy of queue priority assignment. Simulation results show that the algorithm controls the overflow rate of each queue effectively and utilizes the buffer capacity according to the queues priority assigned sufficiently. The algorithm is realized in Verilog-HDL. Comparing with a leading method, the overflow rate is reduced 30% with additional 2,015um2 in area.
Simulating closed regimes with agent based models
Authors: R. Bhavnani, D. Backer, R. Riolo
Venue: Complexity (2008)

This article describes efforts to develop an exploratory agent-based model as a tool for studying decision making in political regimes such as Iraq, North Korea, and Syria. Our hybrid of the landscape metaphor and the rule-based system approach captures the trade-offs leaders face in balancing components of a utility function, plus risk profiles that allow departures from conventional utility maximization. Two simple experiments concerning succession demonstrate the surprising compromises both leaders and elites are willing to make, as well as the instability of these bargains. &copy; 2008 Wiley Periodicals, Inc. Complexity, 2008
Approximation of General Stochastic Hybrid Systems by Switching Diffusions with Random Hybrid Jumps
Authors: Alessandro Abate, Maria Prandini, John Lygeros, Shankar Sastry
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

In this work we propose an approximation scheme to transform a general stochastic hybrid system (SHS) into a SHS without forced transitions due to spatial guards. Such switching mechanisms are replaced by spontaneous transitions with state-dependent transition intensities (jump rates). The resulting switching diffusion process with random hybrid jumps is shown to converge in distribution to the original stochastic hybrid system execution. The obtained approximation can be useful for various purposes such as, on the computational side, simulation and reachability analysis, as well as for the theoretical investigation of the model. More generally, it is suggested that SHS which are endowed exclusively with random jumping events are simpler than those that present spatial forcing transitions.In the opening of this work, the general SHS model is presented, a few of its basic properties are discussed, and the concept of generator is introduced. The second part of the paper describes the approximation procedure, introduces the new SHS model, and proves, under some assumptions, its weak convergence to the original system.
Filter Allocation Using Iterative ECNP
Authors: Jan Tožička, Štěpán Urban, Magdalena Prokopova, Michal Pĕchouček
Venue: Proceedings of the 12th international workshop on Cooperative Information Agents XII (2008)

Network devices can filter traffic in order to protect end-user computers against network worms and other threats. Since these devices have very limited memories and cannot deploy filters against every known worm, the traffic can be forwarded to other device during so called filter delegation. In this contribution we present two negotiation based algorithms looking for a good filter delegation solution. We formally describe this filter allocation problem in a network dealing with distribution of filters among agents so that several constraints are fulfilled and we extend this problem to fit a real world task. We show that both the basic problem and its extension are NP-complete. Both algorithms solving this problem are experimentally evaluated on a realistic network simulation.
Occurrence of Gliders in an Infinite Class of Life-Like Cellular Automata
Authors: Susumu Adachi, Ferdinand Peper, Jia Lee, Hiroshi Umeo
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

The Game of Life (GL), Larger Than Life (LtL), and the Kaleidoscope of Life (KL) are cellular automaton (CA) models with a rich palette of configurations, some of which facilitate universal computation. Common to all these models is that the transition rules by which they are governed are outer-totalistic. The KL distinguishes itself by the striking simplicity of its transition rule, which does not even take into account a cell's state itself for its update. This paper investigates an infinite class of CA, all of which are similar to KL except for their differently sized neighborhoods. Characterized by a discrete parameter d, a neighborhood in such a CA consists of the cells at Moore distances 1, 2,..., or d of a cell. We show that signal-carrying configurations ("gliders") occur in infinitely many of these CA models. We also show that the probability of convergence of a random configuration toward a dead cellular space increases with the increase in parameter d. These seemingly contradictory results suggest that the presence of gliders are not necessarily a reliable benchmark for the sustainability of Life in cellular space.
A Pattern Recognition Approach to Diagnose Foot Plant Pathologies: From Segmentation to Classification
Authors: Marco Mora, Mary Carmen Jarur, Leopoldo Pavesi, Eduardo Achu, Horacio Drut
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

Some foot plant diseases such as flat foot and cave foot are usually diagnosed by a human expert. In this paper we propose an original method to diagnose these diseases by using optical color foot plant images. A number of modern image processing and pattern recognition techniques have been employed to configure a system that can dramatically decrease the time in which such analysis are performed, besides delivering robust and reliable results to complement efficiently the specialist's task. Our results demonstrate the feasibility of building such automatic diagnosis systems that can be used as massive first screening methods for detecting foot plant pathologies.
A Reuse-Based Software Development Method
Authors: Yoonsun Lim, Myung Kim, Seungnam Jeong, Anmo Jeong
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

One of the primary obstacles to the reuse of independently-developed binary components on the industrial level lies in that the existing component technologies do not clearly separate component assembly from component development. To tackle this problem, we propose a new component model, a component assembly method, and a runtime framework, which together amounts to what we call Active Binding Technology. This new component model suggests how to make software components as pure parts, and the assembly method expresses message flows between these components in a model, while the runtime framework performs dependency injection to make the components interact with each other observing type safety constraints.
Can Software Be Tied to Hardware? Part II
Authors: Richard Stern
Venue: IEEE Micro (1983)

Requiring operating system software to be used only with the software proprietor's CPU has been held not to violate the federal antitrust laws. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
IBM Power5 Chip: A Dual-Core Multithreaded Processor
Authors: Ron Kalla, Balaram Sinharoy, Joel M. Tendler
Venue: IEEE Micro (2004)

Featuring single- and multithreaded execution, the Power5 provides higher performance in the single-threaded mode than its Power4 predecessor at equivalent frequencies. Enhancements include dynamic resource balancing to efficiently allocate system resources to each thread, software-controlled thread prioritization, and dynamic power management to reduce power consumption without affecting performance.
Understanding and diagnosing routing dynamics in global internet
Authors: Lixia Zhang
Venue:  (2007)

The global routing system is a critical component in the Internet infrastructure. It delivers data to over 210,000 destination networks throughout the Internet. Large scale events such as fiber cuts, power failures, or major changes in network connectivity often lead to large scale routing changes, which in turn can cause widespread disruption in data delivery service. Hence it is critically important to be able to detect all significant routing changes and to identify the origins of these changes. Prior works focused on examining the route changes to individual destinations in an attempt to understand the behavior of the global routing system. Unfortunately the Internet's distributed nature and its sheer size makes such approaches infeasible and ineffective. In this work, we develop a new concept in measuring routing distribution and dynamics. Instead of measuring changes to individual routes, we measure the total number of routes carried over each link, dubbed link weight. By examining the changes to link weight, dubbed rank-change, we easily capture the aggregate route changes. We use link-weights and rank-changes to visually capture large-scale routing events from hundreds of megabytes of routing data collected from operational routers. In addition to enable visual analysis of routing problems, the link weight metric also forms the basis for automated inference to locate the origins of routing changes. We correlate link weight changes across adjacent links and across observations from different vantage points to construct an s-t graph, called a fault graph, which contains a virtual source and sink node. The min-cut that disconnect the source and the sink by cutting the least number of edges is the most likely solution where the problem originated. Our evaluations show that this min-cut heuristic can identify the problem edges with a high accuracy. Another problem facing the Internet today is prefix hijacking where a destination wrongly announces an IP address space it does not own causing routers to send traffic to itself instead of the genuine destination. Prefix hijacking is a major threat to Internet security and detecting a hijack early is important to reduce damage done. To this end we designed a lightweight and easily deployable hijack alert system. We also carried out a systematic evaluation of how impact of a hijack varies based on location of attacker and target and found out that the tier-1 ISPs having the highest degree are much more vulnerable than some of their multi-homed customers. In summary, our definitions of link weight and rank-change contribute a new abstraction to measure Internet routing distribution and dynamics. This new abstraction not only enables a comprehensive visualization of the global routing system and automatic diagnosis, but also opens up new venues for more advanced routing dynamics modeling and analysis. Our work on prefix hijack presents a quick and easy to deploy first step of detection of attacks and also offers new insights into who is more vulnerable against hijacks in the Internet.
Integrating Dynamic Memory Placement with Adaptive Load-Balancing for Parallel Codes on NUMA Multiprocessors
Authors: Paul Slavin, Len Freeman
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

This Paper describes and evaluates a system of dynamic memory migraton for codes executing in a Non-Uniform Memory Access environment. This system of migration applies information about the load-imbalance within a workload in order to determine the affinity between threads of the application and regions of memory. This information then serves as the basis of migration decisions, with the object of minimising the NUMA distance between code and the memory it accesses. Results are presented which demonstrate the effectiveness of this technique in reducing the runtime of a set of representative HPC kernels.