ppxscal/embedding_network huggingface dataset:
Performance and energy consumption improvements in microprocessor systems utilizing a coprocessor data-path
Authors: Michalis D. Galanis, Gregory Dimitroulakos, Costas E. Goutis
Venue: Journal of Signal Processing Systems (2008)

The speedups and the energy reductions achieved in a generic single-chip microprocessor system by employing a high-performance data-path are presented. The data-path acts as a coprocessor that accelerates computational intensive kernel sections thereby increasing the overall performance. The authors have previously introduced the data-path which is composed by flexible computational components (FCCs). These components can realize any two-level sequence of primitive operations. The automated coprocessor synthesis method from high-level software description and its integration to a design flow for executing applications on the system is presented. The overall application speedups of eleven real-life applications, relative to the software execution on the microprocessor, are estimated using the design flow. These speedups are close to theoretical bounds and range from 1.78 to 5.84, having an average value of 3.04, while the overhead in circuit area is small. The energy savings range from 41 to 74%, while the reduction in the application energy-delay product has an average value of 80%. A comparison with another high-performance data-path showed that the proposed coprocessor achieves better performance, consumes less energy and has smaller area-time products for the generated data-paths. Additionally, the FCC data-path achieves better performance in accelerating kernels relative to a VLIW DSP core.
Slowdown in the M/M/1 discriminatory processor-sharing queue
Authors: Sing-Kong Cheung, Bara Kim, Jeongsim Kim
Venue: Performance Evaluation (2008)

We consider a queue with multiple K job classes, Poisson arrivals, and exponentially distributed required service times in which a single processor serves according to the discriminatory processor-sharing (DPS) discipline. For this queue, we obtain the first and second moments of the slowdown, which is a measure for queueing fairness. We then provide numerical examples and discuss aspects of the slowdown in the DPS queue.
Faster symmetry discovery using sparsity of symmetries
Authors: Paul T. Darga, Karem A. Sakallah, Igor L. Markov
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this symmetry. However, existing tools suffer quadratic runtime in the number of symmetries explicitly returned and are of limited use on very large, sparse, symmetric graphs. This paper introduces a new symmetry-discovery algorithm which exploits the sparsity present not only in the input but also the output, i.e., the symmetries themselves. By avoiding quadratic runtime on large graphs, it improves state-of-the-art runtimes from several days to less than a second.
Tools for Students Doing Mobile Fieldwork
Authors: Mattias Rost, Lars Erik Holmquist
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

Students are not always sitting at their desk but are also out in the world. In a university course teaching ethnography and design students were out in the field making observations and collecting data. We gave them access to a wiki, which they used to upload field notes and material as a support for collaboration. In this paper we present three tools we built and deployed to aid the students when in field and when collaborating. The first is a mobile tool used to gather data: a program running on the students’ mobile phones let them take photos, record video and audio, and write simple text notes, which are automatically uploaded to the wiki. The second is an awareness tool that enables the students to quickly see what the others have done in the wiki. The third is a novel browser for the uploaded data, which relates objects by both time and location. We also talk about the experience from having students using the tools live during the course.
Security Requirement Engineering at a Telecom Provider
Authors: Albin Zuccato, Viktor Endersz, Nils Daniels
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

To offer competitive products and services in the telecom business information security serves as an enabler and competitive factor. Unfortunately, traditional risk analysis and security engineering methods have shown to suffer from several shortcomings when applied to the telecom business. To overcome these shortcomings we propose a security engineering method called SKYDD covering information, infrastructure, and business requirements based on information classification. The method uses a combination of reference tables and checklists and addresses many of the shortcomings of traditional methods. Well-integrated in to the development process SKYDD has proven to simplify security requirement gathering, reduce lead times and provide consistent requirements across different projects and project organizations, much of this due to the fact that the method is designed to be used by non-security experts.
Computational complexity of roots of real functions
Authors: K.-I. Ko
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

An attempt is made to give a more accurate classification of the computational complexity of roots of real functions. Attention is focused on the simplest types of functions, namely, one-to-one and k-to-one functions, and the complexity of their roots is characterized in terms of relations between discrete complexity classes, such as LOGSPACE, P, UP, and NP.
Sublinear Recovery of Sparse Wavelet Signals
Authors: R. Maleh, A. C. Gilbert
Venue: Proceedings of the Data Compression Conference (2008)

There are two main classes of decoding algorithms for “compressed sensing,”those which run in time polynomial in the signal length and those which use sublinear resources. Most of the sublinear algorithms focus on signals which are compressible in either the Euclidean domain or the Fourier domain. Unfortunately, most practical signals are not sparse in either one of these domains. However, many are sparse (or nearly so) in the Haar wavelet system. We present a modified sublinear recovery algorithm which utilizes the recursive structure of Reed-Muller codes to recover a wavelet-sparse signal from a small set of pseudo-random measurements. We also discuss an implementation of the algorithm to illustrate proof-of-concept and empirical analysis.
On-demand Video Streaming in Mobile Opportunistic Networks
Authors: Hayoung Yoon, JongWon Kim, Feiselia Tan, Robert Hsieh
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Providing on-demand video streaming services to large numbers of nodes in mobile wireless networks is a challenging task. We propose MOVi Mobile Opportunistic Video-on-demand, a mobile peer-to-peer video-on-demand application based on ubiquitous WiFi enabled devices such as smartphones and Ultra Mobile PCs. MOVi poses new challenges in on-demand video streaming caused by limited wireless communication range, user mobility and variable user population density. MOVi addresses these challenges by exploiting the opportunistic mix use of downlink and direct peer-to-peer communication to significantly improve achievable overall system throughput. Through simulation and actual implementation, we observed that MOVi is able to increase the number of supported concurrent users two fold compared with unicast based on-demand video streaming, as well as reducing video start-up delay by half. Significantly, these performance improvements can be achieved without increasing power consumption at the end device. Using MOVi, users not only share and distribute on-demand video such as YouTube clips for their own performance gain but also for the benefit of the collaborative group.
Thermo-mechanical analysis of advanced electronic packages in early system design
Authors: Johann-Peter Sommer, Olaf Wittler, Dionysios Manessis, Bernd Michel
Venue: Microsystem Technologies (2005)

The thermal and thermo-mechanical behaviour of advanced electronic packages should be taken into account from the initial design phase in order to achieve a high level of reliability. Numerical studies by means of finite element (FE) analyses are very useful in order to reveal and evaluate the essential thermal and mechanical influences which are induced during manufacturing, storing, transport, and operation. Two different types of packages are under investigation, an RF-system on chip including digital and analogue parts on one chip (RF SoC), and combined in a BGA-type package, made by Shellcase Ltd, and a power transistor with all contacts on one side. Parametric FE analyses are presented in order to pre-optimise the shape of the interconnects and to improve the compliance between stiff components before prototyping and real testing.
Incorporating PCA and fuzzy-ART techniques into achieve organism classification based on codon usage consideration
Authors: Kun-Lin Hsieh, I-Ching Yang
Venue: Computers in Biology and Medicine (2008)

To recognize the DNA sequence and mine the hidden information to achieve the classification of organisms are viewed as a difficult work to biologists. As we know, the amino acids are the basic elements to construct DNA. Hence, if the codon usage of amino acids can be analyzed well, the useful information about classification of organisms may be obtained. However, if we choose too many amino acids to perform the clustering analysis, the high dimensions also lead the clustering analysis to be a complicated structure. Hence, in this study, we will incorporate the principle component analysis and fuzzy-ART clustering techniques into constructing an integrated approach. The useful information about organisms classification based on the codon usage can be mined by using the proposed approach. Finally, we also employ a case including 18 bacteria to demonstrate the rationality and feasibility of our proposed approach.
Scalable multigigabit pattern matching for packet inspection
Authors: Ioannis Sourdis, Dionisios N. Pnevmatikatos, Stamatis Vassiliadis
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

In this paper, we consider hardware-based scanning and analyzing packets payload in order to detect hazardous contents. We present two pattern matching techniques to compare incoming packets against intrusion detection search patterns. The first approach, decoded partial CAM (DpCAM), predecodes incoming characters, aligns the decoded data, and performs logical AND on them to produce the match signal for each pattern. The second approach, perfect hashing memory (PHmem), uses perfect hashing to determine a unique memory location that contains the search pattern and a comparison between incoming data and memory output to determine the match. Both techniques are well suited for reconfigurable logic and match about 2200 intrusion detection patterns using a single Virtex2 field-programmable gate-array device. We show that DpCAM achieves a throughput between 2 and 8 Gb/s requiring 0.58-2.57 logic cells per search character. On the other hand, PHmem designs can support 2-5.7 Gb/s using a few tens of block RAMs (630-1404 kb) and only 0.28-0.65 logic cells per character. We evaluate both approaches in terms of performance and area cost and analyze their efficiency, scalability, and tradeoffs. Finally, we show that our designs achieve at least 30% higher efficiency compared to previous work, measured in throughput per area required per search character.
Modeling and Characterization of Schottky Diode on AlGaAs/GaAs HEMT Structure for Rectenna Device
Authors: Norfarariyanti Bte Parimon, Siti Suhaila Bte Mohd Yusof, Abdul Manaf Bin Hashim
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

The modeling and characterization of Schottky diode on AlGaAs/GaAs HEMT structure for rectenna device is presented. The rectenna device can be used as a wireless power supply where it can capture microwave power and convert to the dc power to generate the others devices or circuits on a chip. Design and simulation of Schottky diode on AlGaAs/GaAs HEMT structure was carried out. From the simulated results, it was found that the operating frequency of the Schottky diode is tunable based on the length of coplanar waveguide.
Intrusion Detection with Data Correlation Relation Graph
Authors: Amin Hassanzadeh, Babak Sadeghian
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Intrusion Detection Systems are designed based on the assumption that the behavior of an intruder is different from a normal user of a system. We show that intrusion detection can be done based on the assumption that the correlation of system events and parameters is changed during an attack to the system. In this paper, we propose a new method in correlating data and events for "Network Based Intrusion Detection Systems". When an attack occurs, the correlation of security parameters is changed. We propose to use the state of correlation between parameters to detect an attack. First we show how to select effective security parameters for our detection engine with statistical correlation methods. Then, we propose how to build Correlation Relation Graphs (CRG) for the parameters showing higher correlation. Finally we show how the attack may be detected with comparing the CRG parameter pairs for each session with the deviation from the regression line of them. We present our results for detecting a SynFlood attack with this method. We give also the corresponding detection rate and false alarm rate.
Understanding bug fix patterns in verilog
Authors: Sangeetha Sudakrishnan, Janaki Madhavan, E. James Whitehead,  Jr., Jose Renau
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

Today, many electronic systems are developed using a hardware description language, a kind of software that can be converted into integrated circuits or programmable logic devices. Like traditional software projects, hardware projects have bugs, and significant developer time is spent fixing them. A useful first step toward reducing bugs in hardware is developing an understanding of the frequency of different types of errors. Once the most common types are known, it is then possible to focus attention on eliminating them. As most hardware projects use software configuration management repositories, these can be mined for the textual bug fix changes. In this project, we analyze the bug fix history of four hardware projects written in Verilog and manually define 25 bug fix patterns. The frequency of each bug type is then computed for all projects. We find that 29 -- 55% of the bug fix pattern instances in Verilog involve assignment statements, while 18 -- 25% are related to if statements.
Learning to reduce the semantic gap in web image retrieval and annotation
Authors: Changhu Wang, Lei Zhang, Hong-Jiang Zhang
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We study in this paper the problem of bridging the semantic gap between low-level image features and high-level semantic concepts, which is the key hindrance in content-based image retrieval. Piloted by the rich textual information of Web images, the proposed framework tries to learn a new distance measure in the visual space, which can be used to retrieve more semantically relevant images for any unseen query image. The framework differentiates with traditional distance metric learning methods in the following ways. 1) A ranking-based distance metric learning method is proposed for image retrieval problem, by optimizing the leave-one-out retrieval performance on the training data. 2) To be scalable, millions of images together with rich textual information have been crawled from the Web to learn the similarity measure, and the learning framework particularly considers the indexing problem to ensure the retrieval efficiency. 3) To alleviate the noises in the unbalanced labels of images and fully utilize the textual information, a Latent Dirichlet Allocation based topic-level text model is introduced to define pairwise semantic similarity between any two images. The learnt distance measure can be directly applied to applications such as content-based image retrieval and search-based image annotation. Experimental results on the two applications in a two million Web image database show both the effectiveness and efficiency of the proposed framework.
On the linear arboricity of planar graphs
Authors: Jian-Liang Wu
Venue: Journal of Graph Theory (1999)

The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. Akiyama, Exoo, and Harary conjectured that [&Delta;/2] &le; la(G) &le; [&Delta;+1/2] for any simple graph G with maximum degree &Delta;. The conjecture has been proved to be true for graphs having &Delta; = 1, 2, 3, 4, 5, 6, 8, 10. Combining these results, we prove in the article that the conjecture is true for planar graphs having &Delta;(G) &ne; 7. Several related results assuming some conditions on the girth are obtained as well. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 31: 129134, 1999
A privacy aware and efficient security infrastructure for vehicular ad hoc networks
Authors: Klaus Plöíl, Hannes Federrath
Venue: Computer Standards Interfaces (2008)

VANETs have the potential to dramatically increase road safety by giving drivers more time to react adequately to dangerous situations. To prevent abuse of VANETs, a security infrastructure is needed that ensures security requirements like message integrity, confidentiality, and availability. After giving more details on the requirements we propose a security infrastructure that uses asymmetric as well as symmetric cryptography and tamper resistant hardware. While fulfilling the requirements, our proposal is especially designed to protect privacy of the VANET users and proves to be very efficient in terms of computational needs and bandwidth overhead.
The search for the model gamer
Authors: Clive Chandler, Len Noriega
Venue: Proceedings of the 9th International Conference on Circuits (2005)

Games can be considered as open texts in the sense suggested by Umberto Eco, this gives rise to the concept of model readers. We can therefore postulate a question as to the existence of such an entity as a model game player. This paper suggests that there is indeed a model game player however, not as a single entity, but rather a composite of many different competences and expectations. A suggested taxonomy of model gamers is discussed, and the benefits of the application of these models are indicated, further research lines are also presented.
Using Non-adaptive Group Testing to Construct Spy Agent Routes
Authors: Georgios Kalogridis, Chris J. Mitchell
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

We consider a network of remote agent platforms that are tested by roaming spy agents in order to identify those that are malicious, based on the outcome of each agent. It is shown that, given a set of spying requirements, the task of choosing the sets of platforms which spy agents visit can be abstracted as a group testing problem. Non-adaptive group testing, in particular, is considered in greater detail, and a simple combinatorial construction for a set of agent routes is presented which combines known results from the prior art. Although existing techniques enable us to construct efficient sets of agent routes, optimality remains an open problem.
Mathematical models for the control of a pest population by infected pest
Authors: Xia Wang, Xinyu Song
Venue: Computers Mathematics with Applications (2008)

In this paper, we propose two mathematical models concerning continuous and impulsive pest control strategies, respectively. Therefore, our models are the ordinary differential equations and the impulsive differential equations. As a result, the global asymptotic stability of the equilibria of the ordinary differential equations is studied. In the case when an impulsive control is used, it is observed that there exists a globally asymptotically stable susceptible pest-eradication periodic solution when the amount of infective pests released periodically is larger than some critical value. When the amount of infective pests released is less than this critical value, the system is shown to be permanent, which implies that the trivial susceptible pest-eradication solution loses its stability. Finally, by means of numerical simulation, we obtain the critical values of the control variable under different methods of release of infected pests.
Pareto Frontiers of Sensor Networks for Localization
Authors: Volkan Cevher, Lance Kaplan
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

We develop a theory to predict the localization performance of randomly distributed sensor networks consisting of various sensor modalities when only a constant active subset of sensors that minimize localization error is used for estimation. The characteristics of the modalities include measurement type (bearing or range) and error, sensor reliability, FOV, sensing range, and mobility. We show that the localization performance of a sensor network is a function of a weighted sum of the total number of each sensor modality. We also show that optimization of this weighted sum is independent of how the sensor management strategy chooses the active sensors. We combine the utility objective with other objectives, such as lifetime, coverage and reliability to determine the best mix of sensors for an optimal sensor network design. The Pareto efficient frontier of the multi objectives are obtained with a dynamic program, which also accommodates additional convex constraints.
A pairwise decision tree framework for hyperspectral classification
Authors: J. Chen, R. Wang
Venue: International Journal of Remote Sensing (2007)

A novel pairwise decision tree (PDT) framework is proposed for hyperspectral classification, where no partitions and clustering are needed and the original C-class problem is divided into a set of two-class problems. The top of the tree includes all original classes. Each internal node consists of either a set of class pairs or a set of class pairs and a single class. The pairs are selected by the proposed sequential forward selection (SFS) or sequential backward selection (SBS) algorithms. The current node is divided into next-stage nodes by excluding either class of each selected pair. In the classification, an unlabelled pixel is recursively classified into the next node, by excluding the less similar class of each node pair until the classification result is obtained. Compared to the single-stage classifier approach, the pairwise classifier framework and the binary hierarchical classifier (BHC), experiments on an Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) data set for a nine-class problem demonstrated the effectiveness of the proposed framework.