ppxscal/embedding_network huggingface dataset:
EM analysis of a wireless Java-based PDA
Authors: Catherine H. Gebotys, Brian A. White
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2008)

The susceptibility of wireless portable devices to electromagnetic (EM) attacks is largely unknown. If analysis of electromagnetic (EM) waves emanating from the wireless device during a cryptographic computation do leak sufficient information, it may be possible for an attacker to reconstruct the secret key. Possession of the secret cryptographic key would render all future wireless communications insecure and cause further potential problems, such as identity theft. Despite the complexities of a PDA wireless device, such as operating system events, interrupts, cache misses, and other interfering events, this article demonstrates that, for the first time, repeatable EM differential attacks are possible. The proposed differential analysis methodology involves precharacterization of the PDA device (thresholding and pattern recognition), and a new frequency-based differential analysis. Unlike previous research, the new methodology does not require perfect alignment of EM frames and is repeatable in the presence of a complex embedded system (including cache misses, operating system events, etc), thus supporting attacks on real embedded systems. This research is important for future wireless embedded systems, which will increasingly demand higher levels of security.
Device Model for Ballistic CNFETs Using the First Conducting Band
Authors: Hamidreza Hashempour, Fabrizio Lombardi
Venue: IEEE Design Test (2008)

This article presents an approximate model for the drain-source current of a carbon nanotube FET (CNFET) in the ballistic regime by using the first conducting band. The proposed model is symbolic in terms of carbon nanotube (CNT) features and presents a closed-form solution to the drain-source current as functions of parameters such as temperature, device terminal voltages, device geometry, Fermi levels, and CNT diameter. The model is analytic and particularly amenable to CAD tools for a fast, accurate calculation of the drain-source current in a CNFET. An evaluation of the model with respect to RMS errors (absolute and normalized) is presented. The ranges of normalized RMS errors are 2% to 7% for diameter variations of 3 nm to 0.5 nm, 2% to 5% for gate-source bias variations of 0 to supply, 5% to 6% for drain-source bias variations of 0 to supply, and 2% to 9% for Fermi-level variations of -0.2 eV to -0.8 eV. The execution of the model is at least 410 times faster than numerical models.
System reduction using eigen spectrum analysis and Padé approximation technique
Authors: G. Parmar, S. Mukherjee, R. Prasad
Venue: International Journal of Computer Mathematics (2007)

A mixed method is proposed for deriving reduced-order models of high-order linear time invariant systems using the combined advantages of eigen spectrum analysis and the Padé approximation technique. The denominator of the reduced-order model is found by eigen spectrum analysis, the dynamics of the numerator are chosen using the Padé approximation technique. This method guarantees stability of the reduced model if the original high-order system is stable. The method is illustrated by three numerical examples.
Location-based media sharing in a MP2P network
Authors: Niko Kotilainen, Lito Kriara, Konstantinos Vandikas, Konstantinos Mastorakis, Maria Papadopouli
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

In both academia and industry, peer-to-peer (p2p) applications have attracted great attention. This paper introduces and implemented a novel location-based multimedia application, the Multimedia Traveling Journal application (PhotoJournal) that employs the p2p paradigm and enables location-based content sharing among mobile users.
Datalog vs. first-order logic
Authors: M. Ajtai
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The relation between the expressive power of datalog and that of first-order languages, is clarified. It is then proved that every first-order expressible datalog query is bounded. A form of compactness theorem for finite structure implied by this result is examined, and counterexamples to natural generalizations of the above result are given.
Prediction of Induced Current in Externally Excited Dipole Antenna Using Fuzzy Inference
Authors: Saeed Reza Ostadzadeh, Mohammad Soleimani, Majid Tayarani
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In this paper, our previously introduced fuzzy modeling method is used to model the induced current in the externally excited dipole antenna. In our model, behavior of the problem is saved as a set of unchanged membership functions and the knowledge of the incident angle is extracted as very simple curves of starting parameters. Then the induced current of the externally excited dipole antenna for any incident angle can be predicted very easily by applying the starting parameters calculated from the achieved simple curves to fuzzy system. Comparing fuzzy model results with the method of moments (MoM) shows very good agreement while execution time is surprisingly short even for wide bandwidth.
Optimization of temperature of polysilicon rods
Authors: Dzh. Mamytov, T. P. Samokhvalova, Zh. Sharshenaliev
Venue: Automation and Remote Control (2008)

The problem of synthesis of optimal control for temperature of polysilicon rods is solved taking heat emission into account. A method of dynamic programming for linear systems with distributed parameters (SDP), a modified performance criterion, and a moderated form of solution to the functional Bellman equations for SDP are used. The obtained control algorithms for polysilicon were numerically realized earlier.
A Context Query Language for Pervasive Computing Environments
Authors: Roland Reichle, Michael Wagner, Mohammad Ullah Khan, Kurt Geihs, Massimo Valla, Cristina Fra, Nearchos Paspallis, George A. Papadopoulos
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

This paper identifies requirements for querying andaccessing context information in mobile and pervasivecomputing environments. Furthermore it studiesexisting query languages showing that they satisfy onlya subset of these requirements or cover some of themonly to a limited extent. A new context query languageis presented to overcome these shortcomings,improving the state of the art in several respects:heterogeneous representations of context information,definition of complex filtering mechanisms, elaborateaggregation functions and ontology integration, all inone language.
Biometrics in Identity Management Systems
Authors: James L. Wayman
Venue: IEEE Security and Privacy (2008)

Biometric technology—the automated recognition of individuals using biological and behavioral traits—can connect bodily persons to identity records to create a one-to-one correspondence between people and records, restricting people to one record or records to one person. They are a natural tool for identity management, but many suggest that biometric technologies invade privacy. The author addresses the controversies surrounding biometrics by looking more deeply into the basic assumptions made in biometric recognition. He discusses how biometric attributes can be used as verifiers and identifiers, and make suggestions about how people can regain control over how their identities are managed.
The Gray graph revisited
Authors: Dragan Marusi&cbreve;, Tomaz Pisanski
Venue: Journal of Graph Theory (2000)

Certain graph-theoretic properties and alternative definitions of the Gray graph, the smallest known cubic edge- but not vertex-transitive graph, are discussed in detail. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 35: 1&ndash;7, 2000
Cryptographic Key Management for SCADA Systems-Issues and Perspectives
Authors: Ludovic Piètre-Cambacédès, Pascal Sitbon
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

This article focuses on cryptographic Key Management Systems (KMS) for SCADA systems environments. It first gives a generic view on the constraints, requirements and desired technical properties in SCADA contexts. Then, the most widespread solutions are presented, before discussing how they meet such conditions. The work done by different initiatives on this issue is also introduced. Finally, perspectives and research directions are proposed in consequence. The article aims at presenting open issues on the area, to foster discussion and research, according to the authors’ view.
The changing face of programming
Authors: Brian Kernighan
Venue: Journal of Computing Sciences in Colleges (2008)

The rapid evolution of languages, tools, environments and expectations resents major challenges and opportunities for programmers and for software engineering education. This is true across all kinds of programming, but is especially so for Web systems, which are now routinely written in untyped scripting languages and include Ajax, ashups, toolkits, frameworks like Rails and Django, and a profusion of interfaces, all operating asynchronously on distributed systems.
Applying fuzzy linguistic preference relations to the improvement of consistency of fuzzy AHP
Authors: Tien-Chin Wang, Yueh-Hsiang Chen
Venue: Information Sciences: an International Journal (2008)

The lack of consistency in decision making can lead to inconsistent conclusions. In fuzzy analytic hierarchy process (fuzzy AHP) method, it is difficult to ensure a consistent pairwise comparison. Furthermore, establishing a pairwise comparison matrix requires nx(n-1)2 judgments for a level with n criteria (alternatives). The number of comparisons increases as the number of criteria increases. Therefore, the decision makers judgments will most likely be inconsistent. To alleviate inconsistencies, this study applies fuzzy linguistic preference relations (Fuzzy LinPreRa) to construct a pairwise comparison matrix with additive reciprocal property and consistency. In this study, the fuzzy AHP method is reviewed, and then the Fuzzy LinPreRa method is proposed. Finally, the presented method is applied to the example addressed by Kahraman et al. [C. Kahraman, D. Ruan, I. Dogan, Fuzzy group decision making for facility location selection, Information Sciences 157 (2003) 135-153]. This study reveals that the proposed method yields consistent decision rankings from only n-1 pairwise comparisons, which is the same result as in Kahraman et al. research. The presented fuzzy linguistic preference relations method is an easy and practical way to provide a mechanism for improving consistency in fuzzy AHP method.
A tool for teaching LL and LR parsing algorithms
Authors: César García-Osorio, Carlos Gómez-Palacios, Nicolás García-Pedrajas
Venue: ACM SIGCSE Bulletin (2008)

In this paper we present a tool to assist in teaching top-down and bottom-up analysis algorithms. The tool provides simulation for the following analysis algorithms: LL, SLR, LALR and LR. During the simulation the student can simultaneously see the pending input, the analysis stack and tables, the generated output and the parse tree.
Chord-Based Key Establishment Schemes for Sensor Networks
Authors: Fan Zhang, Zhijie Jerry Shi, Bing Wang
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Because of limited resources at sensor nodes, sensor networks typically adopt symmetric-key algorithms to provide security functions such as protecting communications between nodes. In order to use symmetric-key algorithms, two nodes need to establish a secret session key first. In this paper, we propose a novel chord-based key establishment (CBKE) protocol that allows any pair of nodes in a sensor network to establish a secret session key. CBKE is a generalized deterministic key establishment scheme that provides great flexibility for balancing memory overhead, reliability, and communication cost. We analyze the properties of CBKE and explore the performance tradeoffs using simulation.
Adventures in Social Research: Data Analysis Using SPSS 14.0 and 15.0 for Windows, 6th edition
Authors: Earl Robert Babbie, Frederick S. Halley, Jeanne S. Zaino
Venue:  (2007)

*This is NOT the edition that comes with the student version of SPSS software. To order that, please order ISBN: 9781412940825.* Adventures in Social Research: Data Analysis Using SPSS 14.0 and 15.0 for Windows, Sixth Edition guides readers step-by-step through the process of data analysis using the latest version of SPSS and the most up to date version of the General Social Survey. In this thoroughly revised edition, authors Earl Babbie, Fred Halley, and Jeanne Zaino stress active and collaborative learning as students engage in a series of practical investigative exercises. New to the Sixth Edition: Presents the latest version of SPSS for Windows: Readers are introduced to computerized data analysis using the latest version of SPSS for Windows (14.0 & 15.0). Gives access to the latest version of the GSS: In the text and lab exercises, readers are given a chance to work with data from the most recent General Social Survey (GSS 2004). Provides a shorter, more condensed version than the Fifth Edition: The latest edition has been restructured to make the material more user-friendly for students, including a separate chapter on recoding and a more straightforward discussion of composite measures. Accompanied by High Quality Ancillaries! An accompanying CD-ROM contains data sets, Designing Your Own Survey, and comprehensive appendices that include questionnaires, research reports, proposals, survey tips, commands, readings, and much more. *Note - this CD-ROM runs only on computers with SPSS installed. If you do not have SPSS installed, please order the version of this book that comes with the student version of SPSS (ISBN 9781412940825).Intended Audience: Designed for both introductory and advanced research methods or statistics courses in Sociology, Political Science, Social Work, Criminal Justice, and Public Health departments, this is an ideal computer skills and data analysis textbook for any discipline that uses survey methods.
Exploring E-Commerce Benefits for Businesses in a Developing Country
Authors: Alemayehu Molla, Richard Heeks
Venue: The Information Society (2007)

Developing countries are home to more than 80% of the world's population, and are the site for growing use of e-commerce. There are theoretical claims that e-commerce could bring significant benefits to firms in developing countries, but we know very little empirically about the actual outcomes of e-commerce implementation. Our article addresses this gap in knowledge through a survey of 92 businesses in South Africa, all of which have moved beyond the basic stage of e-commerce. The findings indicate that e-commerce benefits are, by and large, limited to improvements in intra-and interorganizational communications. More strategic benefits relating to market access, customer/supplier linkages or cost savings were not found in the majority (more than 80%) of organizations surveyed. This therefore limits the likelihood of broader benefits such as incorporation into global supply chains, disintermediation, and improved competitiveness. Turning this somewhat disappointing e-commerce picture around requires a multiprong strategy aimed at building the resources and capabilities of businesses, developing electronic-mediated business routines with partners and customers, and addressing national e-readiness and global trade regulation issues.
Resolving the productivity paradox
Authors: Kenneth I. Carlaw, Les Oxley
Venue: Mathematics and Computers in Simulation (2008)

Solow [R. Solow, We'd Better Watch out, New York Times Book Review, 1987, p. 36] made the statement that 'we see computers everywhere except in the productivity statistics'. This has come to be known as the ''productivity paradox''. Whether this is in fact a paradox or a direct implication of the diffusion of technical change is the focus of this paper. In particular, the implications of two different theoretical treatments of technology diffusion in an economy are considered; the traditional model of [R. Solow, A contribution to the theory of economic growth, Q. J. Econ., 70 (1956) 65-94] and the alternative view of [R.G. Lipsey, K.I. Carlaw, C.T. Bekar, Economic Transformations: General Purpose Technologies and Long Term Economic Growth, Oxford University Press, Oxford, 2005]. These two distinct views articulate two general empirically testable hypotheses that are captured in a number of specific tests including measures of the diffusion of information and communication technologies (ICT). Although weak, the evidence supports the view of [R.G. Lipsey, K.I. Carlaw, C.T. Bekar, Economic Transformations: General Purpose Technologies and Long Term Economic Growth, Oxford University Press, Oxford, 2005].
Linear phase FIR filter design using particle swarm optimization and genetic algorithms
Authors: Jehad I. Ababneh, Mohammad H. Bataineh
Venue: Digital Signal Processing (2008)

In this paper, a linear phase FIR filter is designed using particle swarm optimization (PSO) and genetic algorithms (GA). Two design cases are considered. In the first case, the filter length, passband and stopband frequencies, and the ratio of the passband and stopband ripples size are specified. In the second case, a feasible passband and stopband ripples size in addition to the other three filter specifications are specified. The later situation is not explicitly considered by the Parks-McClellan (PM) algorithm. Furthermore, the PSO and the GA are used to design optimum FIR filters for which the filter coefficients are represented using finite word length. In all cases, the design goal is successfully achieved using the PSO and compared with that obtained using the GA. For the problem at hand, it is found that the PSO outperforms the GA in some of the presented design cases.
iMST: A bandwidth-guaranteed topology control algorithm for TDMA-based ad hoc networks with sectorized antennas
Authors: Chee-Wei Ang, Chen-Khong Tham
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Many topology control algorithms aim to minimize energy consumption, interference, etc. while maintaining connectivity among the nodes. Links are realized between nodes by proper adjustment of transmission power in each node. However, a link is not useful if its bandwidth is lower than what is required by the applications it supports. Therefore, topology control algorithms should also consider the minimum realizable link bandwidth when generating topologies. As the realizable bandwidth of a link depends on the amount of interference received, interference analysis must be carried out. We study the minimum realizable link bandwidth of a given network under a TDMA/TDD channel sharing mechanism. We carried out the interference analysis assuming the general multi-sectored antenna configuration, since an omni-directional antenna can be visualized as a special configuration of a sectorized antenna (i.e. with 1 sector). We then proceed to derive the transmission power to be used in each sector of all nodes in the network to maximize average channel utilization. However, a brute-force method that runs through all possible topologies takes exponential time. We thus propose an algorithm, iMST, that attempts to maximize average channel utilization by reducing interference. The iMST algorithm not only generates k-edge-connected networks, but also guarantees minimum link bandwidth. Although iMST requires global knowledge of the locations of nodes, by using a distributed MST generation method, iMST can be run in a distributed manner. The iMST scheme is evaluated and compared against a modified Fault-tolerant Cone-Based Topology Control (FCBTC) scheme, referred to as s-FCBTC, that works with sectorized antennas, on a few performance metrics: average channel utilization, network diameter, minimum link bandwidth and edge-connectedness, where edge-connectedness is a new metric defined in this paper. The iMST scheme is shown to exhibit good performance in many of these performance metrics.
Predicting (0, 1)-functions on randomly drawn points
Authors: D. Haussler, N. Littlestone, M. K. Warmuth
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The authors consider the problem of predicting (0, 1)-valued functions on R/sup n/ and smaller domains, based on their values on randomly drawn points. Their model is related to L.G. Valiant's learnability model (1984), but does not require the hypotheses used for prediction to be represented in any specified form. The authors first disregard computational complexity and show how to construct prediction strategies that are optimal to within a constant factor for any reasonable class F of target functions. These prediction strategies use the 1-inclusion graph structure from N. Alon et al.'s work on geometric range queries (1987) to minimize the probability of incorrect prediction. They then turn to computationally efficient algorithms. For indicator functions of axis-parallel rectangles and halfspaces in R/sup n/, they demonstrate how their techniques can be applied to construct computational efficient prediction strategies that are optimal to within a constant factor. They compare the general performance of prediction strategies derived by their method to those derived from existing methods in Valiant's learnability theory.
In-line transmission electron microscopy for micro and nanotechnologies research and development
Authors: V. Delaye, F. Andrieu, F. Aussenac, O. Faynot, R. Truche, C. Carabasse, A. L. Foucher, A. Danel, A. Chabli-Brenac
Venue: Microelectronic Engineering (2008)

The size reduction and increasing complexity of micro and nanotechnologies involve a need for advanced morphological and chemical characterization. Furthermore, reduced cycle time, low cost and high resolution imaging are required. To figure out this new challenge, a TEM and a full 200 and 300mm wafer FIB-SEM dual beam for sample preparation have been installed close to each other inside a process line cleanroom. Means to reach TEM and STEM atomic resolution inside cleanroom environment are presented. A sample preparation to observation flow of few hours is described. Impact of samples lift-out on wafers at different process levels is studied in the case of fully depleted silicon on insulator (FDSOI) CMOS technology. Electrical performances of adjacent transistors are measured and interpreted using SEM imaging of FIB crater areas.
Possibilities of the direct implementation of control algorithms from environment MATLAB/Simulink
Authors: Švancara Kamil, Pivonka Petr
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

The implementation of the control algorithms from the simulation environment into industrial controller is necessary to solve effectively in relation to minimization of implementation errors. The capability of algorithm transmission into the industrial controller is important and transmission time should be minimal. Is it obvious that the control algorithms are designed and developed in simulation environment first and they are implemented into the industrial controllers in the real production processes afterwards. The object of this paper is an analysis of possibilities of the control algorithm direct implementation from today's most applicable simulation environment in automation - MATLAB into PLC - programmable logic controller. The advantages of the direct implementation of control algorithms are given first of all by the minimum of implementation errors in comparison with the indirect implementation. The development of heterogeneous control algorithms becomes faster. The choice of optimal control algorithm is relatively simple due to its proven functionality in the real processes.