ppxscal/embedding_network huggingface dataset:
Power/Performance/Thermal Design-Space Exploration for Multicore Architectures
Authors: Matteo Monchiero, Ramon Canal, Antonio Gonzalez
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

Multicore architectures are ruling the recent microprocessor design trend. This is due to different reasons: better performance, thread-level parallelism bounds in modern applications, ILP diminishing returns, better thermal/power scaling (many small cores dissipate less than a large and complex one); and, ease and reuse of design. This paper presents a thorough evaluation of multicore architectures. The architecture we target is composed of a configurable number of cores, a memory hierarchy consisting of private L1, shared/private L2, and a shared bus interconnect. We consider a benchmark set composed of several parallel shared memory applications. We explore the design space related to the number of cores, L2 cache size and processor complexity, showing the behavior of the different configurations/ applications with respect to performance, energy consumption and temperature. Design tradeoffs are analyzed, stressing the interdependency of the metrics and design factors. In particular, we evaluate several chip floorplans. Their power/thermal characteristics are analyzed, showing the importance of considering thermal effects at the architectural level to achieve the best design choice.
Handheld mobile net devices and its application in education
Authors: Rong-Jyue Fang, Hung Jen Yang, Hua Lin Tsai, Chi Jen Lee
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

This study intends to investigate handheld mobile net devices and its application in education. The study went through literature review and staged interview. The interview process targeted on students and parents from an experimental primary class located in Kaohsiung Country, southern Taiwan. They all joined the digital experimental project in that specific primary school. In the experimental period each parents in that class were distributed a PHS phone. Through message transmission and mobile net communication, parents discussed and shared feelings with teacher and other parents through using mobile devices (pros & cons). The research summarized their usage and provided references opinion information to country commissioner and educational related officials to encourage further innovative pedagogy use.
A New CORDIC Algorithm and Software Implementation Based on Synchronized Data Triggering Architecture
Authors: Xin-biao Gan, Kui Dai, Li-bo Huang, Li Shen, Zhi-ying Wang
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

A new CORDIC algorithm based on sign bits prediction is presented. It is an effective method for reducing arbitrary iterations of classic CORDIC to only one iteration and transforming CORDIC iterations to simple matrix multiplications. At the same time, this algorithm is implemented and experimented on based on Synchronized Data Triggering Architecture (SDTA). Experimental results show that the average speed-up of transcendental functions tested based on our CORDIC algorithm compared with mathematic library supported in gcc3.2.2 under the given Neuron microprocessor is close to 283%.
Exploring Protein Regulations with Regulatory Networks for Cancer Classification
Authors: Hong Qiang Wang, Hai Long Zhu, Timothy T. C. Yip, William C. S. Cho, Roger K. C. Ngan, Stephen C. K. Law
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

This paper proposes a novel modeling technique for understanding cancer signal pathway and applies to cancer classification. In the approach, specific to a cancer group, a regulatory network is constructed between biomarkers and is optimized towards minimizing its energy function that is defined as disagreement between input and output of the network. The non-linear version of this network is achieved by imposing a sigmoid kernel function. The proposed approach is tested on protein profiling data of nasopharyngeal carcinoma and is compared with support vector machines with linear and radial basis function kernels
European and American Audio-Visual Speech Recognition, Using SVM in Portuguese Language
Authors: Adriano de Andrade Bresolin, Diamantino Rui da Silva Freitas, Adrião Duarte Dória Neto, Pablo Javier Alsina
Venue: Proceedings of the Data Compression Conference (2008)

This paper proposes an audio-visual speech recognition system using SVM (Support Vector Machine) in European and American Portuguese Language. The main objective in this work is to find a model that can be used in both languages. Furthermore, two new methods to extract the Mouth Region (ROI-Region of interest) and Lip Contour arepresented. Two audio and four video features are used in the experiments. These features are combined in pairs, totalizing eight tests in the speaker dependent-case. Experiments were performed at various SNRs (0-40dB) with additive white Gaussian noise. The results showed that the proposed method can be used in both languages without any adaption.
Building a Distributed E-Healthcare System Using SOA
Authors: Firat Kart, Louise E. Moser, P. Michael Melliar-Smith
Venue: IT Professional (2008)

This article describes a distributed e-healthcare system that uses the service-oriented architecture as a means of designing, implementing, and managing healthcare services.
Interaction in Time and Space
Authors: Gabriel Ciobanu
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Distributed @p-calculus and ambient calculus are extended with timers which may trigger timeout recovery processes. Timers provide a useful notion of relative time with respect to the interaction in a distributed system. The rather flat notion of space in timed distributed @p-calculus is improved by considering a hierarchical representation of space in timed mobile ambients. Some basic results are proven, making sound both formal approaches. An easily understood example is used for both extensions, showing how it is possible to describe a non-monotonic behaviour and use a decentralized control to coordinate the interacting components in time and space.
A monitoring-aware network-on-chip design flow
Authors: Calin Ciordas, Andreas Hansson, Kees Goossens, Twan Basten
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

Networks-on-chip (NoC) are a scalable interconnect solution for systems on chip and are rapidly becoming reality. Monitoring is a key enabler for debugging or performance analysis and quality-of-service techniques. The NoC design problem and the NoC monitoring problem cannot be treated in isolation. We propose a monitoring-aware NoC design flow able to take into account the monitoring requirements in general. We illustrate our flow with a debug driven monitoring case study of transaction monitoring. By treating the NoC design and monitoring problems in synergy, the area cost of monitoring can be limited to 3-20% in general. We also investigate run-time configuration options for the NoC monitoring system resulting in acceptable configuration times.
Deconstructing wireless errors: collision or 'bad' channel?
Authors: Shravan Rayanchu, Dheeraj Agrawal, Sharad Saha, Arunesh Mishra, Suman Banerjee
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

Last few years have seen a tremendous growth of WiFi devices, and with the introduction of smart devices like Zune, iPhone etc., which offer a variety of WiFi-based Internet applications, this trend is only going to accelerate. However, the current throughput/delay characteristics of 802.11 systems are not sufficient to support applications like high definition video streaming, VoIP, online gaming etc. Although, 802.11 theoretically supports data rates up to 54 Mbps, its performance is well below claims.
Comments on "Optimal Resource Allocation in Overlay Multicast"
Authors: Jinyao Yan, Martin May, Bernhard Plattner
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

In this comments paper, we revisit the network model introduced in [1]. We discuss the inaccuracy of the model and, to correct the network model, we propose to apply directed capacity constraints for directed flows. Based on comparison of numerical results, we show that the corrected model leads to better accuracy than the original model.
Dynamic scheduling for dedicated grid and task scheduling with reliable communication for non-dedicated grid
Authors: Xiaoli Du, Rong Deng, Changjun Jiang, Fei Yin
Venue: Proceedings of the 2007 Asian technology information program's (ATIP's) 3rd workshop on High performance computing in China: solution approaches to impediments for high performance computing (2007)

For the different properties between dedicated grid and non-dedicated grid, two algorithms, named by DSADG (a Dynamic Scheduling Algorithm for Dedicated grid) and SARCNG (a Scheduling Algorithm with Reliable Communications for Non-dedicated grid), are presented. The former, based on the idea of dynamic critical path, proposes the method to compute the difference index of task executing on different grid nodes. Compared with other 9 algorithms, DSADG shows lower time complexity, smaller make-span and less grid nodes used in the scheduling process. Based on DSADG and the theories of queue and random process, the latter, focusing on the distinguishable features like heterogeneousness, reliability and availability, presents a function that scales the task scheduling reliability and grid node availability. Test results show SARCNG can not only ensure a smaller make-span, but also choose grid nodes with higher reliability.
A canonical neural circuit for cortical nonlinear operations
Authors: Minjoon Kouh, Tomaso Poggio
Venue: Neural Computation (2008)

A few distinct cortical operations have been postulated over the past few years, suggested by experimental data on nonlinear neural response across different areas in the cortex. Among these, the energy model proposes the summation of quadrature pairs following a squaring nonlinearity in order to explain phase invariance of complex V1 cells. The divisive normalization model assumes a gain-controlling, divisive inhibition to explain sigmoid-like response profiles within a pool of neurons. A gaussian-like operation hypothesizes a bell-shaped response tuned to a specific, optimal pattern of activation of the presynaptic inputs. A max-like operation assumes the selection and transmission of the most active response among a set of neural inputs. We propose that these distinct neural operations can be computed by the same canonical circuitry, involving divisive normalization and polynomial nonlinearities, for different parameter values within the circuit. Hence, this canonical circuit may provide a unifying framework for several circuit models, such as the divisive normalization and the energy models. As a case in point, we consider a feedforward hierarchical model of the ventral pathway of the primate visual cortex, which is built on a combination of the gaussian-like and max-like operations. We show that when the two operations are approximated by the circuit proposed here, the model is capable of generating selective and invariant neural responses and performing object recognition, in good agreement with neurophysiological data.
A New Type of Image-Based Key
Authors: Bruce Kirchoff, David Remington, Lixin Fu, Fereidoon Sadri
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Keys are character based tools for plant identification. They are based on the decomposition of the plant into very small, atomistic parts. These parts are described with the technical and often arcane terminology of plant taxonomy. Even the best electronic keys (Delta, Lucid) make use of this terminology. Keys are not based on pattern recognition, the forte of visual experts. Instead they demand that the user look at the plant as if it consisted of a series of isolated parts that are classified by name. Keys would be more effective if they were visually based. They would be easier to use for visual experts because accurate perception is their providence. They would also be easier to use for novices because they would not depend on knowledge of arcane terminology. This paper proposed an innovative image-based key system for species recognition.
Automatic architecture refinement techniques for customizing processing elements
Authors: Bita Gorjiara, Daniel Gajski
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In this paper, we propose an approach for designing high-performance energy-efficient processing elements (PEs) using statically-scheduled nanocode-based architectures. Our approach is based on bottom-up refinement/trimming techniques that optimize a given datapath irrespective of whether it was designed manually or generated automatically. The optimizations can also preserve parts of the netlist specified by the designers, and hence, allow reuse of design efforts and can lead to predictable convergence. In this paper, we show that trimming unused and underutilized resources of typical general-purpose datapaths can lead to 30-40% average energy savings, without any performance loss. However, general-purpose architectures often compromise parallelism to make the design implementable. With our trimming approach, we can afford to have a base architecture that is not intended for implementation and has more parallelism, and then apply refinement to make it implementable. For our benchmarks, we achieved up to 1.8 times (avg. 25%) and 2.6 times (avg. 40%) performance improvement, compared to two general-purpose architectures (i.e. a 4-issue VLIW and a DLX), respectively. Additionally, the energy consumption is reduced by up to 5 times (avg. 2 times) compared to the trimmed general-purpose architectures.
Are unbounded linear operators computable on the average for Gaussian measures?
Authors: Volker Bosserhoff
Venue: Journal of Complexity (2008)

Traub and Werschulz [Complexity and Information, Cambridge University Press, New York, 1999] ask whether every linear operator S:@?X->Y is ''computable on the average'' w.r.t. a Gaussian measure on X. The question is inspired by an analogous result in information-based complexity on the average-case solvability of linear approximation problems. We give several interpretations of Traub and Werschulz' question within the framework of type-2 theory of effectivity. We have negative answers to all of these interpretations but the one with minimal requirements on the algorithm's uniformness. On our way to these results, we give an effective version of the Mourier-Prokhorov characterization of Gaussian measures on separable Hilbert spaces.
3D mosaics with variable-sized tiles
Authors: V. A. Dos Passos, M. Walter
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

Three dimensional mosaics, or surface mosaics, are a beautiful art form where a sculpture is made from putting together tiles on a given shape. Although 2D mosaics have attracted a lot of attention in graphics research, the same is not true for 3D mosaics. We present in this paper a technique to simulate 3D mosaics where the size of the individual pieces vary according to the local geometry. Previous work on this topic have addressed the problem of mosaics with tiles of the same size. The user specifies the number of tiles and our system covers a given 3D shape with square-shaped tiles with size adjusted according to the local curvature of the surface. The user can also controls the number of tiles, orientation on the surface, and relative size of tiles.
The complexity of the membership problem for 2-generated commutative semigroups of rational matrices
Authors: Jin-yi Cai
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We present a deterministic polynomial-time algorithm for the ABC problem, which is the membership problem for 2-generated commutative linear semigroups over an algebraic number field. We also obtain a polynomial time algorithm, for the (easier) membership problem, for 2-generated abelian linear groups. Furthermore, we provide a polynomial-sized encoding for the set of all solutions.
A case study of hardware/software partitioning of traffic simulation on the Cray XD1
Authors: Justin L. Tripp, Maya B. Gokhale, Anders Å. Hansson
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Scientific application kernels mapped to reconfigurable hardware have been reported to have 10 × to 100 × speedup over equivalent software. These promising results suggest that reconfigurable logic might offer significant speedup on applications in science and engineering. To accurately assess the benefit of hardware acceleration on scientific applications, however, it is necessary to consider the entire application including software components as well as the accelerated kernels. Aspects to be considered include alternative methods of hardware/software partitioning, communications costs, and opportunities for concurrent computation between software and hardware. Analysis of these factors is beyond the scope of current automatic parallelizing compilers. In this paper, a case study is presented in which a simulation of metropolitan road traffic networks is mapped onto a reconfigurable supercomputer, the Cray XD1. Five different methods are presented for mapping the application onto the combined hardware/software system. An approach for approximating the performance of each method is derived through analytic equations. Our results, both analytically and empirically, show that key predictors of performance (which are often not considered in reported speedup of kernel operations) are not necessarily maximum parallelism, but must account for the fraction of the problem that runs on the reconfigurable logic and the amount data flow between software and hardware.
On minimal imperfect graphs with circular symmetry
Authors: Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann
Venue: Journal of Graph Theory (1998)

Results of Lov&aacute;sz and Padberg entail that the class of so-called partitionable graphs contains all the potential counterexamples to Berge's famous Strong Perfect Graph Conjecture, which asserts that the only minimal imperfect graphs are the odd chordless cycles with at least five vertices (&ldquo;odd holes&rdquo;) and their complements (&ldquo;odd antiholes&rdquo;). Only two constructions (due to Chv&aacute;tal, Graham, Perold, and Whitesides) are known for making partitionable graphs. The first one does not produce any counterexample to Berge's Conjecture, as shown by Seb&ouml;. Here we prove that the second one does not produce any counterexample either. This second construction is given by near-factorizations of cyclic groups based on the so-called &ldquo;British number systems&rdquo; introduced by De Bruijn. All the partitionable graphs generated by this second construction (in particular odd holes and odd antiholes) have circular symmetry. No other partitionable graph with circular symmetry is known, and we conjecture that none exists; in this direction we prove that any counterexample must contain a clique and a stable set with at least six vertices each. Also we prove that every minimal imperfect graph with circular symmetry must have an odd number of vertices. &copy; 1998 John Wiley & Sons, Inc. J Graph Theory 29: 209&ndash;225, 1998
Economic impact evaluation of short-term load forecast errors using a mutative scale chaos optimization algorithm
Authors: Jiang Chuanwen, Li Shuai, Wang Chengmin
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

Under the circumstances of Power Market, load forecast errors directly lead to the increase of costs of dispatch and maintenance. With a mutative scale chaos optimization algorithm (MSCOA), and the next-day units bidding model as the valuation model for economy of load forecast errors, this paper quantitatively analyzes the influence of load forecast errors on the marginal prices and purchase costs of the grid. Computations give results with practical meanings: losses caused by negative load errors are larger than those caused by positive ones. The algorithm put forward is of fine convergence.
Attention guided football video content recommendation on mobile devices
Authors: Reede Ren, Joemon M. Jose
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

Live football video is the major content genre in 3G mobile service. In this paper, we introduce a realtime general highlight detection algorithm based on attention analysis. It combines attention-related media modalities into role-based attention curves, namely video director, spectator and commentator, to track viewers' feeling against game content from media data. A series of linear temporal predictors are assumed from video data directly and employed to allocate strong attention changes, which are marked as scroll-back endpoints for mobile video skim. The advantages of our algorithm are that it avoids semantic uncertainty of game highlights and that it requires little training. We evaluated our approach using the test bed with full five games from different content suppliers to prove the robustness.
Short Circuit Modelling and Simulation of 2x25 kV High Speed Railways
Authors: Luigi Battistelli, Mario Pagano, Daniela Proto, Arturo Amendola, Luigi Candurro, Alfonso Pignotti
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In the paper, a detailed model for short circuit analysis of the AC 2x25 kV-50 Hz traction system has been derived and implemented. Two different methods have been used: the time domain and frequency domain approaches. The two approaches are discussed and numerical applications are reported in order to evidence the feasibility of the two procedures.
WSRF-Based Modeling of Clinical Trial Information for Collaborative Cancer Research
Authors: Tianyi Zang, Radu Calinescu, Steve Harris, Andrew Tsui, Marta Kwiatkowska, Jeremy Gibbons, Jim Davies, Peter Maccallum, Carlos Caldas
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

The CancerGrid consortium is developing open-standards cancer informatics to address the challenges posed by modern cancer clinical trials. This paper presents the service-oriented software paradigm implemented in CancerGrid to derive clinical trial information management systems for collaborative cancer research across multiple institutions. Our proposal is founded on a combination of a clinical trial (meta)model and WSRF (Web Services Resource Framework), and is currently being evaluated for use in early phase trials. Although primarily targeted at cancer research, our approach is readily applicable to other areas for which a similar information model is available.
Decidability of Weak Bisimilarity for a Subset of BPA
Authors: Haiyan Chen
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

In this paper we use the tableau as a means to prove decidability of weak bisimulation for normed BPA. Decidability was proved for a restricted subclass, the totally normed processes by Hirshfeld [Hirshfeld, Y., Bisimulation trees and the decidability of weak bisimulations. In: INFINITY 1996. proceedings of the 1st International Workshop on Verification of Infinite State Systems, Germany, vol. 5]. However in the case that weak bisimilarity to be decidable is inequivalence is finitely approximable. In this paper we relax restriction of totally normedness and prove decidability of weak bisimilarity for a subset of normed BPA which permit the norm of BPA processes is zero.