ppxscal/embedding_network huggingface dataset:
Tamper Proofing by Design Using Generalized Involution-Based Concurrent Error Detection for Involutional Substitution Permutation and Feistel Networks
Authors: Nikhil Joshi, Jayachandran Sundararajan, Kaijie Wu, Bo Yang, Ramesh Karri
Venue: IEEE Transactions on Computers (2006)

Secure operation of cryptographic algorithms is critical to the success of secure transactions. Fault-based attacks that recover secret keys by deliberately introducing fault(s) in cipher implementations and analyzing the faulty outputs have been proven to be extremely powerful. Substitution Permutation Networks (SPN) and Feistel Networks (FN) are the two important classes of Symmetric Block Ciphers. Some SPN ciphers and all FN Ciphers satisfy the involution property. A function F is an involution if F(F(x)) = x. In this paper, we investigate tamper proofing techniques that use low cost involution-based time redundancy concurrent error detection (CED) schemes for involutional SPN and FN symmetric block ciphers. We incorporated this tamper proofing by design technique in a hardware implementation of the 128-bit ANUBIS SPN cipher (an involution variant of the Advanced Encryption Standard (AES)) and the 128-bit TwoFish FN cipher (an AES finalist). We performed fault simulation at both the algorithm and the gate level to show that the low-cost involution-based CED schemes, in addition to detecting all transient faults, can detect all single-bit permanent faults and > 99 percent of all multiple-bit permanent faults. Consequently, this low cost CED technique can protect the crypto device against Differential Fault Analysis (DFA) attacks.
Baker transformation as autoregression system
Authors: A. F. Goloubentsev, V. M. Anikin, S. A. Noyanova, Y. A. Barulina
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

We study the baker transformation in the context of an autoregression model (digital filter) of the first order. An initial condition x/sub 0/ is supposed to be a random value having the uniform distribution on the interval (0,1). Being unbiased, binary digits of x/sub 0/, 0 and 1, have the occurrence probability equal to 1/2 . The y-component of the baker transformation is represented as a linear autoregression equation of the first order where binary digits of x/sub 0/ play the role of an excitation (input signal). It is shown that the digital filter corresponding to the baker transformation is causal, stable and reversible one. The asymptotic regime of baker transform dynamics does not depend on the distribution of the initial value y/sub 0/.
Position Paper: The Importance of Experience with Industry in Software Engineering Education
Authors: Rayford B. Jr. Vaughn, Jeffrey Carver
Venue: Proceedings of the 19th Conference on Software Engineering Education and Training Workshops (2006)

This paper describes experiences and lessons learned at an ABET accredited software engineering program with respect to students at the undergraduate and graduate levels studying and/or researching the application of software engineering techniques. Examples of successful interactions are provided as well as the rationale for including industry experience. Disadvantages of such interactions are also included when appropriate.
PhyloMiner: A Tool for Evolutionary Data Analysis
Authors: Sen Z h a n g, Katherine G. Herbert, Jason T. L. Wang, William H. Piel, David R. B. Stockwell
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

Currently, phylogenetic tree techniques are being used in multiple areas, from Tree of Life problems to pathogen recognition to drug discovery. With all of these applications for phylogenetic tree techniques, methods are needed to exploit the knowledge modeled in phylogenetic trees more thoroughly. One such information point of interest is the behavior of frequent patterns in phylogenetic trees. While there are many techniques that look at maximal, consensus and supertreepatterns, there are few techniques that look at frequent, but not maximal pattern. This demonstration paper presents PhyloMiner, a tool that automatically discovers frequent agreement subtrees from multiple phylogenies. It introduces this topic of frequent agreement subtrees and then concludes with describing the PhyloMiner tool that implements these concepts and is available freely on the World Wide Web.
Future Live iTV Production: Challenges and Opportunities
Authors: Richard Wages, Stefan M. Grunvogel, Janez Zaletelj, Carmen Mac Williams, Georg Trogemann
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

Today's TV broadcasting companies are highly professionalized in the production of linear TV formats. Workflows and technologies for these linear formats are reliable, the production personnel is highly skilled and we can trust in well-known viewing habits of the consumers. The key issue of this paper is: how do we enable such a broadcasting working environment to produce by far more variable, multi-perspective or interactive TV formats? We are especially interested in formats entailing a multitude of live audiovisual material like for example sport events or elections, which shall be transformed into an interactive TV event for the consumer at home. This paper is not concerned with the variety of technical problems the interactive TV paradigm leads to, but with questions of future tools and practices on the producers' side, levels of consumer personalization and the respective consumer interfaces to make digital content accessible.
Simulation of simultaneous safe recursion over an arbitrary structure
Authors: Olga Xirotiri
Venue: Information Processing Letters (2006)

In [O. Bournez, F. Cucker, P.J. de Naurois, J.Y. Marion, Computability over an arbitrary structure. Sequential and parallel polynomial time, in: Lecture Notes in Computer Science, vol. 2620, Springer, Berlin, 2003, pp. 185-199] the class of safe recursive functions over an arbitrary structure is defined. A question of simulation of the simultaneous safe recursion by single safe recursion was set. We prove that this simulation is feasible using bounded coding and decoding functions.
IEEE Micro 2006 Annual Index, Volume 25
Venue: IEEE Micro (2006)

This index includes all items appearing in IEEE Micro during 2006 that are considered to have archival value. 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
Visual Web Mining of Organizational Web Sites
Authors: C Oosthuizen, J Wesson, C Cilliers
Venue: Proceedings of the conference on Information Visualization (2006)

Existing web usage mining (WUM) tools do not indicate which data mining algorithms are used or provide effective graphical visualizations of the results obtained. WUM techniques can be used to determine typical navigation patterns in an organizational web site. The process of combining WUM and information visualization techniques in order to discover useful information about web usage patterns is called visual web mining. The goal of this paper is to discuss the development of a visual web mining prototype, called WebPatterns, which allows the user to effectively visualize web usage patterns.
Capacities of Physical Layer Scheduling Strategies on a Shared Link
Authors: Jyri Hämäläinen, Risto Wichman
Venue: Wireless Personal Communications: An International Journal (2006)

We compare capacities of three physical layer scheduling algorithms: on-off scheduling (OOS), maximum SNR, and round robin schedulers. With OOS, downlink transmission is suspended if the instantaneous received SNR in the mobile station falls below a given threshold requiring only one feedback bit per user, which considerably decreases the overhead of the feedback signaling when compared with maximum SNR scheduler. In case of FDD systems, OOS and maximum SNR schedulers require a fast feedback channel from mobile to base station like the one in the FDD WCDMA system, while round robin operates independently of the channel state.We derive asymptotic capacity gains of the three schedulers in high SNR region and study the effect of feedback bit errors to capacities. It is noticed that OOS has an optimal threshold, which depends on the number of users and their mean SNRs. As expected, maximum SNR scheduler provides the largest capacity among the three schedulers, but if additional spatial diversity, i.e., transmit antenna selection is available, the difference between the capacities of OOS and maximum SNR schedulers is small.
XMI for XP project data interchange
Authors: G. Concas, M. Marchesi, A. Cau, S. Pinna, K. Mannaro, N. Serra
Venue: Proceedings of the 2004 workshop on Quantitative techniques for software agile process (2004)

In recent years Extreme Programming and Agile Methodologies are becoming very popular among academics and practitioners of software engineering. In order to create a knowledge base on XP and agile methodologies, a common standard for process data representation is needed. This standard can also be used for interchanging data among different tools supporting XP projects. In this paper we present XMI as a possible solution to this problem. We show the advantages of XMI for XP project data collection and interchange. XMI is an OMG standard for modelling data object semantics in XML syntax. It integrates XML and UML and requires the definition of a model for data that must be interchanged. In this context we have defined a UML model for an XP project. The XP project model consists of a set of UML classes diagrams representing the XP project entities, their properties and relationships. The model can be easily extended to other agile methodologies. We used this model for exporting process data from XPSwiki, a tool for XP project management and for process data collection.
VR content platform for multi-projection displays with realtime image adjustment
Authors: Takafumi Koike, Kei Utsugi, Michio Oikawa
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

We propose a VR content platform for multi-projection displays. Our platform has in common features with frame synchronization methods without any special hardware and real-time image adjustment mechanism with graphics processing units.We realized the image adjustment mechanisms as image effects. The image effects used multipass rendering, multitexturing, and programmable shaders. Therefore we can easily extend adjustment algorithms, and use multiple effects, and implemented several image filters.In above features, we can reduce workflow to create content for multi-projection display. Because we can efficiently operate post-productions for content for multi-projection display. We used our system to create high-resolution movie contents for seamless multi-projection display.
Reconfigurable Streaming Architectures for Embedded Smart Cameras
Authors: Sek M. Chai, Nikolaos Bellas, Greg Kujawa, Tom Ziomek, Linda Dawson, Tony Scaminaci, Malcolm Dwyer, Dan Linzmeier
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Smart cameras using FPGAs require an automation method to simplify the design process and to ensure both computation and memory performance are met. Reconfigurable logic allows exploration of different hardware accelerators and memory-hierarchy configurations based on application needs. This paper presents a streaming architecture template that is generated from high level program descriptions. A smart camera development platform, the software architecture, and demonstration template are also described.
Locating factors of the infinite Fibonacci word
Authors: Wai-Fong Chuan, Hui-Ling Ho
Venue: Theoretical Computer Science (2005)

Let τ = (√5 - 1)/2. Let a, b be two distinct letters. The infinite Fibonacci word is the infinite word G = babbababbabbababbababbabba... whose nth letter is a (resp., b) if [(n + 1)τ] - [nτ] = 0 (resp., 1). For a factor w of G, the location of w is the set of all positions in G at which w occurs. Only the locations of the following factors of G are already known: squares, singular words and those factors of G whose lengths are Fibonacci numbers. The purpose of this paper is to determine the locations of all factors of G. Our results contain all the known ones as consequences. Moreover, using our results, we are able to identify any factor of G whenever its starting position and length are given; also we are able to tell whether two suffixes of G have a common prefix of a certain length.
A Tracking Algorithm in RFID Reader Network
Authors: Wei Jiang, Dan Yu, Yan Ma
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

Radio Frequency Identification (RFID) is a hot research topic in recent years. And connecting RFID readers to construct a mesh network, which is defined as RFID Reader Network herein, by short-range wireless technologies (such as ZigBee) is a promising architecture. RFID reader can sense (identify) persons, animals, vehicles and goods by interrogating transponders tagged on them. From this perspective, RFID Reader and Reader Network is Sensor and Sensor Network that is context-aware, respectively. However, only sensing is not enough in many scenarios. Therefore, in this paper, we propose a tracking algorithm, coined Virtual Route Tracking (VRT), to realize tracking persons or objects in RFID Reader Network.
Geometric interpretation of multiaccess joint detection and the alternating projection algorithm
Authors: R. E. Learned, S. Mallat, B. Claus, A. S. Willsky
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The joint detection of all users in a multiple access (MA) communication system in which user transmissions are correlated has been shown in recent literature to enhance the system performance relative to that achieved without joint detection. Over the past several years the area of low complexity joint detectors has received much attention. This paper explains the problem of multiple access joint detection in geometrical terms. Geometric interpretation leads to the proposal of an alternating projection joint detection algorithm (APJD). Due to some similarities between our APJD and the multistage joint detector (MJD) of Varansi and Aazhang (1990), the MJD is also discussed. The APJD is guaranteed to converge and a proof is given. The geometric interpretation of the MA joint detection problem allows for the exploration of determining, a priori, the error probability of a joint detector and user waveform set in the absence of noise. Simulations offer empirical characterization of the error behavior of both detectors.
Estimating neutral divergence amongst Mammals for Comparative Genomics with Mammalian scope
Authors: Anup Bhatkar, J. L. Rana
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

Comparative sequence analyses on a collection of carefully chosen mammalian genomes could facilitate identification of functional elements within the human genome and allow quantification of evolutionary constraint at the single nucleotide level. High-resolution quantification would be informative for determining the distribution of important positions within functional elements and for evaluating the relative importance of nucleotide sites that carry single nucleotide polymorphisms (SNPs). The level of resolution in comparative sequence analyses is a direct function of sequence diversity, so the information content of a candidate mammalian genome can be defined as the sequence divergence it would add relative to alreadysequenced genomes. Our study involves sequences from 29 mammals and we compute total neutral divergence present in set of mammals. Our results of how different mammals add to neutral divergence to the already fully sequenced mammals would increases the effectiveness of comparative genomics with mammalian scope.
Choosing a Programming Language
Authors: Diomidis Spinellis
Venue: IEEE Software (2006)

There's no language suitable for all tasks, and there probably won't ever be one. When choosing a programming language, you have to balance programmer productivity, maintainability, efficiency, portability, tool support, and software and hardware interfaces. Often, one of these factors will shape your decision. In other cases, the choice depends on the productivity you gain from certain language features, such as modularity and type checking, or external factors, such as integrated development environment support. Finally, for some tasks, adopting an existing domain-specific language, building a new one, or using a general-purpose declarative language can be the right choice.
A comparative study of predictive transmit power control schemes for S-UMTS
Authors: Harry S. H. Gombachika, Rahim Tafazolli, Barry G. Evans
Venue: Wireless Networks (2005)

Transmit power control is indispensable in Direct Sequence Code Division Multiple Access (DS/CDMA) based systems such as the Satellite Universal Mobile Telecommunication System (S-UMTS). Since S-UMTS aims at achieving close integration with the terrestrial component (T-UMTS) in its complementary role, it is going to implement closed-loop transmit power control (TPC) at a slow rate of once every frame. In addition, predictive schemes can be used to mitigate the effects of delay. In this regard, recursive-least-squares (RLS) and least-mean-square (LMS) algorithms are normally employed. The RLS algorithm has a higher convergence rate than the LMS algorithm: an attractive attribute when the fading process abruptly changes. The LMS algorithm, on the other hand, has better tracking property than the RLS algorithm: an attractive attribute when the changes in the fading process are persistently slow. However, the mobile satellite system channel exhibits both attributes: abrupt changes and slow drifts. In this paper, therefore, we compare the performance of predictive TPC based on the RLS and the LMS algorithms for S-UMTS with the conventional TPC as a reference. We demonstrate that the predictive TPC schemes perform better than the conventional TPC scheme. However, the performance gain achieved depends on the predictive algorithm used, the environment in which the user equipment is operating, and loop delays. We show that, in general, the LMS based predictive TPC offers better performance than the RLS based predictive TPC scheme in S-UMTS environment.
Performance tradeoffs in sequencer design on a new G4 PowerPC/sup TM/ microprocessor
Authors: L. K. John
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

The microprocessor discussed in this paper is a new member of the G4 family of PowerPC microprocessors with AltiVec/sup TM/ enhanced technology, intended for high performance desktop systems. This four-way superscalar design is more deeply pipelined than previous designs in order to achieve greater frequency. The challenge in increasing frequency is to translate most or all of that increase into performance increases, and this requires careful analysis from a performance simulator. This paper specifically looks at how the interaction between frequency and performance goals affected the design of the new G4 instruction sequencer.
Study of ambiguities of linear arrays
Authors: C. Proukakis, A. Manikas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

The paper is concerned with the ambiguities inherent in the manifold of any uniform or nonuniform linear-array. Ambiguities arise when the manifold repeats itself or when a point on the array manifold can be written as a linear combination of other points. So far only "trivial" ambiguities associated with uniform linear arrays have been studied in the literature. These ambiguities are viewed as appearance of grating lobes when beamforming is used. In the paper the ambiguity problem is extended to any linear geometry and to "non-trivial" ambiguities. Then a new technique is proposed for identifying the ambiguous sets associated with a given geometry.
Communication management using abstraction in distributed Bayesian networks
Authors: Jiaying Shen, Victor Lesser
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Techniques were developed in previous work for managing communication in a controlled satisficing manner in two layer distributed Bayesian Networks. DEC-MDPs were used to sequence the information transferred in order to guarantee the required confidence level. In this paper, we introduce multiple abstraction layers into the Distributed Bayesian Network as a way of carrying more useful information in transmitted data to further reduce the number of messages that need to be sent. An algorithm is developed to automatically generate appropriate abstraction data. Techniques are introduced to effectively incorporate this abstraction data set into the DEC-MDP framework. We show that the appropriate addition of abstraction data actions simplifies the DEC-MDP while reducing the expected communication cost. This work provides us with a formal view of the use of abstraction in agent cooperation and begins to give us an understanding of when the less abstract data needs to be transmitted.
Nonlinear recovery of sparse signals from narrowband data
Authors: R. A. Gopinath
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

This paper describes the connection between a certain signal recovery problem and the decoding of Reed-Solomon codes. It is shown that any algorithm for decoding Reed-Solomon codes (over finite fields) can be used to recover wide-band signals (over the real/complex field) from narrow-band information. It also shows that a signal with at most N/sub t/ frequency samples can be recovered from any contiguous band of 2N/sub t/ frequency samples.
Knowledge Integration On-The-Fly in Swarm Intelligent Systems
Authors: Robert G. Reynolds, Bin Peng
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Cultural Algorithms employ a basic set of knowledge sources, each related to knowledge observed in various social species. These knowledge sources are then combined to direct the decisions of the individual agents in solving optimization problems. Here we develop an algorithm based upon an analogy to the marginal value theorem in foraging theory to guide the integration of these different knowledge sources to direct the agent population. Application to real-valued function optimization and an optimization problem in engineering design are used to illustrate the principles.