ppxscal/embedding_network huggingface dataset:
Cross-layer design of energy-constrained networks using cooperative MIMO techniques
Authors: Shuguang Cui, Andrea J. Goldsmith
Venue: Signal Processing (2006)

We consider networks where energy is a limited resource so that energy consumption must be minimized while satisfying given throughput requirements. For such networks, cross-layer design coupled with node cooperation can significantly reduce both energy consumption and delay. In this paper, we propose a cooperative multiple-input multiple-output (MIMO) technique where multiple nodes within a cluster cooperate in signal transmission and/or reception. In our scheme, local information exchange within the cluster is not necessary if Alamouti codes are used with appropriate transmission scheduling. A cross-layer design framework is then applied that optimizes routing to minimize the energy consumption and delay. For the cooperative MIMO scheme, routing is optimized based on an equivalent single-input single-out (SISO) system, where each cooperating cluster is treated as a super node. We derive the best energy-delay tradeoff curve under this optimization model and show that the cooperative MIMO approach dramatically improves energy and delay performance, especially when link layer adaptation is used.
On a class of discrete functions
Authors: Dimiter Stoichkov Kovachev
Venue: Acta Cybernetica (2006)

We consider classes of functions which depend in a certain way on their variables. The relation between the number of H-functions of n variables of the k-valued logic and the number of n-dimensional Latin hypercubes of order k is found. We have shown how from an arbitrary Latin hypercube we can "construct" (present in table form) an H-function and vice versa - how every H-function can be represented as a Latin hypercube. We extend the concepts of H-function and Latin hypercube.
Geometric spanners with few edges and degree five
Authors: Michiel Smid
Venue: Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51 (2006)

An O(n log n)-time algorithm is presented that, when given a set S of n points in Rd and an integer k with 0 ≤ k ≤ n, computes a graph with vertex set S, that contains at most n - 1 + k edges, has stretch factor O(n/(k+1), and whose degree is at most five. This generalizes a recent result of Aronov et al., who obtained this result for two-dimensional point sets.
User involvement and user satisfaction with information-seeking activity
Authors: Paulus Insap Santosa, Kwok Kee Wei, Hock Chuan Chan
Venue: European Journal of Information Systems (2005)

This paper presents the result of an empirical study that investigates user involvement and user satisfaction in the context of information-seeking activity. This study adopts the definition of user involvement as the psychological state of the importance and personal relevance that users attach to a given system. Following Celsi and Oison, intrinsic and situational motivators were considered as two antecedents of user involvement. These two types of motivator were treated as formative exogenous variables, while user involvement and user satisfaction were treated as reflective mediating endogenous variable and final endogenous variable, respectively. Five hypotheses were proposed, and all were supported by the data from a laboratory experiment. This paper also reports two other interesting findings. First, intrinsic motivators have a stronger positive effect on user involvement than situational motivators have. Second, situational motivators have a stronger positive effect on user satisfaction than intrinsic motivators have. The discussion part explains these interesting findings.
Controlling-dependent process steps using variable sample size control charts: Research Articles
Authors: Su-Fen Yang, Hui-Chun Su
Venue: Applied Stochastic Models in Business and Industry (2006)

The article considers the variable process control scheme for two dependent process steps. We construct variable sample size (VSS) Z&Xmacr; and Z&emacr; control charts to effectively monitor the quality variable produced by the first process step and the quality variable produced by the second process step 2, respectively. The performance of the proposed VSS control charts is measured by the adjusted average time to signal (AATS) using a Markov chain approach. An example of producing cotton yarn system shows the application and performance of the proposed VSS Z&Xmacr; and Z&emacr; control charts in detecting shifts in process mean. Furthermore, the performance of the VSS Z&Xmacr; and Z&emacr; control charts and the fixed sample size (FSS) Z&Xmacr; and Z&emacr; control charts are compared by numerical analysis results. These demonstrate that the former is much faster in detecting small shifts in mean. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Voluntary Employee Turover: Why IT Professionals Leave
Authors: Patrick Thomas Burnes
Venue: IT Professional (2006)

Lack of leadership and organizational loyalty, along with poor compensation, technology, and communicationare a few reasons for high employee turnover.
A Planar Light Probe
Authors: Neil G. Alldrin, David J. Kriegman
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We develop a novel technique for measuring lighting that exploits the interaction of light with a set of custom BRDFs. This enables the construction of a planar light probe with certain advantages over existing methods for measuring lighting. To facilitate the construction of our light probe, we derive a new class of bi-directional reflectance functions based on the interaction of light through two planar surfaces separated by a transparent medium. Under certain assumptions and proper selection of the two surfaces, we show how to recover Fourier series coefficients of the incident lighting parameterized over the plane. The results are experimentally validated by imaging a sheet of glass with spatially varying patterns printed on either side.
Designing Full-Connectivity WDM Optical Interconnects with Reduced Switching and Conversion Complexity
Authors: Haitham S. Hamza, Jitender S. Deogun
Venue: Proceedings of the 14th IEEE Symposium on High-Performance Interconnects (2006)

Most existing wavelength division multiplexing (WDM) optical interconnects make use of a large number of switching elements and require wide-range tunable wavelength converters to support full-connectivity among inputs and outputs. This results in complex and expensive designs. In this paper, we propose new full-connectivity single-stage and multi-stage WDM optical interconnects with and reduced hardware complexity. The proposed designs require a smaller number of switching elements and use only fixedrange wavelength conversion. Analysis of hardware complexity shows that, the proposed designs have a smaller number of switching and conversion costs compared to most existing interconnects.
Static Code Analysis
Authors: Panagiotis Louridas
Venue: IEEE Software (2006)

Static code checkers are usually deployed after compilation and before testing. The success of Lint, a C source code program checker from 1977, has generated many descendant tools, both open source and proprietary. The author examines three open source tools and one commercial product.
SAEDES++: determining complex system availability via simulation
Authors: Javier Faulin, Angel A. Juan, Carles Serrat, Vicente Bargueño
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Complex systems are everywhere among us: telecommunication networks, computers, transporting vehicles, and electrical appliances are well known examples. Designing reliable systems and determining their availability are both very important tasks for managers and engineers, since reliability and availability have a strong relationship to other concepts such as quality and safety. Furthermore, these tasks are extremely difficult, due to the fact that analytical methods can become too complicated, inefficient or even inappropriate when dealing with sophisticated systems. In this paper we present the basic ideas behind a simulation-based method, called SAEDES, which can be very useful when determining availability for a wide range of complex systems. The method is implemented in C/C++ using two different algorithms, SAEDES_A1 (component-oriented) and SAEDES_A2 (system-oriented). Two case-studies are introduced and analyzed using both algorithms, which allows us to compare the associated results.
Mentor Graphics DFT to Navigate Nanometer Test Challenges
Authors: Greg Aldrich, Ron Press, Takeo Kobayashi, Tatsuo Sakajiri
Venue: Proceedings of the 15th Asian Test Symposium (2006)

Nanometer designs are getting smaller and bigger. Feature sizes are moving into nanometer geometries. Semiconductor companies creating these nanometer designs are struggling with many issues that result from this shrinking complex design environment. Mentor Graphics Design-For-Test is committed to helping you navigate these challenges to bringing a high quality product to market while reducing test cost.
Stream-Based Implementation of Hash Functions for Multi-Gigabit Message Authentication Codes
Authors: Yu-Kuen Lai, Gregory T. Byrd
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Stream processing architectures have been proposed as efficient and flexible platforms for network packet processing. As part of an investigation into stream-based network processors, we have implementedMMH, a family of almostuniversal hash functions for message authentication, on a SIMD stream processor (Imagine). The hash computation over an entire packet is a good fit for the stream programming model, with an abundance of producer-consumer locality: hash values are computed and stored in the stream register file (SRF), then used for calculating new hash values repeatedly. By using eight VLIW clusters, the construction is performed in a Multi-SIMDfashion, achieving multi- Gigabit-per-second throughput with a collision probability on the order of 2^-120 .
Rate adaptation transcoding for video streaming over wireless channels
Authors: Zhijun Lei, N. D. Georganas
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this work, we investigate the problem of bit rate adaptation transcoding for transmitting video over burst-error wireless channels. In particular, we consider a scenario consisting of packet-based transmission with an automatic repeat request (ARQ) error control scheme. We first analyze the buffering implications of inserting a video transcoder at the wireless access point with the variable bit rate channel as the target. We derive the conditions that both the source encoder and transcoder buffers have to satisfy for preventing the decoder buffer from underflowing. Furthermore, we propose a bit rate adaptation algorithm for VBR transcoders used in the wireless access point. Our experimental results demonstrate that visual quality can be improved by the proposed algorithm without violating the end-to-end delay requirements.
An E-based splitting finite element method for time-dependent eddy current equations
Authors: Tong Kang, Kwang Ik Kim, Zhengpeng Wu
Venue: Journal of Computational and Applied Mathematics (2006)

A new decoupled finite element method is suggested to approximate time-dependent eddy current equations in a three-dimensional polyhedral domain. This method is based on solving a vector and a scalar from the splitting of the electric field by using edge and nodal finite elements. An optimal energy-norm error estimate in finite time is obtained by introducing a projection operator.
Traversing the tangle: algorithms and applications for cophylogenetic studies
Authors: Michael A. Charleston, Susan L. Perkins
Venue: Journal of Biomedical Informatics (2006)

Cophylogenetic analysis supposes that two or more phylogenetic trees for linked groups have been constructed, and explores the relationships the trees have with each other. These types of analyses are most commonly used to assess relationships between hosts and their parasites, however the methodology can also be applied to diverse types of problems such as an examination of the phylogenies of genes with respect to those of organisms or those of geographic areas and the organisms that reside there. The working hypothesis is that the trees are correct, though sometimes attempts are made to take into account their uncertainty. Cophylogeny is computationally hard: that is, there are no known fast methods to compute relationships among such trees for any but the simplest of models. A review of methodology that has been developed to examine cophylogenetic relationships is presented and a brief discussion of some medically relevant examples is given.
Detecting the Theft of Natural Language Text Using Birthmark
Authors: Jianlong Yang, Jianmin Wang, Deyi Li
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

To detect the theft of natural language text effectively, we present a novel scheme to derive birthmark from the text. Since birthmark is a unique and native characteristic of every text, a text with the same birthmark of another can be easily suspected of a copy. Ideally, birthmark should satisfy two properties: (a) credibility - independent texts must be distinguished by completely different birthmarks, and (b) resilience - birthmark should be tolerant against meaningpreserving attacks. To evaluate the effectiveness of the proposed birthmark, we conduct two experiments. The first one shows that birthmark successfully distinguishes non-copied files. In the second one, it shows that birthmark has quite good a tolerance against meaning-preserving attacks.
From static distributed systems to dynamic systems: an approach for a first step
Authors: Micheal Raynal
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

A noteworthy advance in distributed computing is due to the recent development of peer-to-peer systems. These systems are essentially dynamic in the sense that no process can get a global knowledge on the system structure. They mainly allow processes to look up for data that can be dynamically added/suppressed in a permanently evolving set of nodes. Although protocols have been developed for such dynamic systems, to our knowledge, up to date no computation model for dynamic systems has been proposed. Nevertheless, there is a strong demand for the definition of such models as soon as one wants to develop provably correct protocols suited to dynamic systems. The talk will present an approach aiming at defining an appropriate model for (a class of) dynamic systems. That dynamic model is defined by (1) a parameter (an integer denoted alpah) and (2) two basic communication abstractions (query-response and persistent reliable broadcast). The parameter alpha is a threshold value introduced to capture the liveness part of the system (it is the counterpart of the minimal number of processes that do not crash in a static system). To show the relevance of the model, the paper discusses several distributed computing issues in the context of dynamic systems, such as atomicity, quorums, and leader election.
Combinatorial invariance of Kazhdan-Lusztig polynomials on intervals starting from the identity
Authors: Ewan Delanoy
Venue: Journal of Algebraic Combinatorics: An International Journal (2006)

We show that for Bruhat intervals starting from the identity in Coxeter groups the conjecture of Lusztig and Dyer holds, that is, the R-polynomials and the Kazhdan-Lusztig polynomials defined on [e,u] only depend on the isomorphism type of [e,u]. To achieve this we use the purely poset-theoretic notion of special matching. Our approach is essentially a synthesis of the explicit formula for special matchings discovered by Brenti and the general special matching machinery developed by Du Cloux.
Altered walking pattern in a virtual environment
Authors: Björn Sondell, Lars Nyberg, Staffan Eriksson, Björn Engström, Anders Backman, Kenneth Holmlund, Gösta Bucht, Lillemor Lundin-Olsson
Venue: Presence: Teleoperators and Virtual Environments (2005)

Falls and fractures among elderly persons constitute a major health problem. Many falls occur while walking and falls that occur during turning often result in a fracture. Methods aimed at understanding the complex mechanisms involved in walking should therefore assess tested individuals during walks and turns. In order to identify persons at risk and take the correct preventive measures, it is important to find methods that quantify movements as the tested persons are processing multisensory input. In a clinical setting this is sometimes difficult to achieve in a controlled manner, since tests are difficult to set exactly the same from one time to another. Using a virtual environment (VE) and a tracker system, conditions such as light, sound, events, body movements, and room size can be controlled and measured. Tests in VE can therefore be identically reproduced over and over again to evaluate if a person can withstand changing outer demands at any given moment. In order to perform quantitative measures 8 persons (21-74 years) were tested in immersive virtual reality. The VE was a corridor in which expected and unexpected events could be produced. Events studied were doors swinging open in front of the subjects during a walk and a virtual tilting of the environment. Trackers were used for collecting and analyzing the movement data. Our results show that the system was well tolerated among the subjects and that there was a clear tendency that the system could generate fall tendency among the subjects. There was also a difference among the subjects regarding walking strategies when subjected to the various events.
Customizing User Interaction in Smart Phones
Authors: Panu Korpipaa, Esko-Juhani Malm, Tapani Rantakokko, Vesa Kyllonen, Juha Kela, Jani Mantyjarvi, Jonna Hakkila, Ilkka Kansala
Venue: IEEE Pervasive Computing (2006)

Emerging input modalities could facilitate more efficient user interactions with mobile devices. An end-user customization tool based on user-defined context-action rules lets users specify personal, multimodal interaction with smart phones and external appliances. The tool's input modalities include sensor-based, user-trainable free-form gestures; pointing with radio frequency tags; and implicit inputs based on such things as sensors, the Bluetooth environment, and phone platform events. The tool enables user-defined functionality through a blackboard-based context framework enhanced to manage the rule-based application control. Test results on a prototype implemented on a smart phone with real context sources show that rule-based customization helps end users efficiently customize their smart phones and use novel input modalities.
Context-Aware Composition of Mobile Services
Authors: Spyros Panagiotakis, Athanassia Alonistioti
Venue: IT Professional (2006)

An intelligent distributed framework for context-aware mobile services lets applications dynamically adapt to changing conditions and contexts over a large variety of infrasturctures and configurations.
On the security of stepwise triangular systems
Authors: Christopher Wolf, An Braeken, Bart Preneel
Venue: Designs, Codes and Cryptography (2006)

In 2003 and 2004, Kasahara and Sakai suggested the two schemes RSE(2)PKC and RSSE(2)PKC, respectively. Both are examples of public key schemes based on $$\mathcal{M}$$ ultivariate $$\mathcal{Q}$$ uadratic equations. In this article, we first introduce Step-wise Triangular Schemes (STS) as a new class of $$\mathcal{M}$$ ultivariate $$\mathcal{Q}$$ uadratic public key schemes. These schemes have m equations, n variables, L steps or layers, r the number of equations and new variables per step and q the size of the underlying finite field $$\mathbb{F}$$ . Then, we derive two very efficient cryptanalytic attacks. The first attack is an inversion attack which computes the message/signature for given ciphertext/message in O(mn 3 Lq r + n 2 Lrq r ), the second is a structural attack which recovers an equivalent version of the secret key in O(mn 3 Lq r + mn 4) operations. As the legitimate user also has a workload growing with q r to recover a message/compute a signature, q r has to be small for efficient schemes and the attacks presented in this article are therefore efficient. After developing our theory, we demonstrate that both RSE(2)PKC and RSSE(2)PKC are special instances of STS and hence, fall to the attacks developed in our article. In particular, we give the solution for the crypto challenge proposed by Kasahara and Sakai. Finally, we demonstrate that STS cannot be the basis for a secure $$\mathcal{M}$$ ultivariate $$\mathcal{Q}$$ uadratic public key scheme by discussing all possible variations and pointing out their vulnerabilities.
An Efficient Euclidean Distance Estimation Scheme for Accelerating VQ Encoding
Authors: Chin-Chen Chang, Kuo-Lung Hung
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Accelerating the calculation of squared Euclidean distances (SED), especially in VQ, is a topic of intensive research. This paper presents a new scheme to speed up this calculation called the compact look-up table (CLUT) method. This method employs a small table and some simple operations to speed up the calculation of SED. The experimental results show that our method takes up a very small amount of extra memory without causing a deterioration in the quality of the image compared with previous methods. In addition, CLUT also provides a very flexible solution for different design strategies when the trade-offs between cost and performance are considered.
Biologically-Inspired Design of Autonomous and Adaptive Grid Services
Authors: Chonho Lee, Junichi Suzuki
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

This paper describes and evaluates a biologically- inspired network architecture that allows grid services to autonomously adapt to dynamic environment changes in the network. Based on the observation that the immune system has elegantly achieved autonomous adaptation, the proposed mechanism, the iNet artificial immune system, is designed after the mechanisms behind how the immune system detects antigens (e.g., viruses) and specifically reacts to them. iNet models a set of environment conditions (e.g., network traffic and resource availability) as an antigen and a behavior of grid services (e.g., migration and replication) as an antibody. iNet allows each grid service to autonomously sense its surrounding environment conditions (an antigen) to evaluate whether it adapts well to the sensed conditions, and if it does not, adaptively perform a behavior (an antibody) suitable for the sensed conditions. Simulation results show that iNet allows grid services to autonomously adapt their population and location to environmental changes for improving their performance (e.g., response time and throughput) and balancing workload.
Reliable Architecture for Power System operational Communications (Integration of Digital PLC & ATM)
Authors: Alessandro Garibbo, Laura Petrolino, Giancarlo Caroti, Francesco Rufino
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

The authors will describe, based on their respective experiences, a novel communication architecture to be utilized in mission-critical realtime applications for electric systems operations. The paper will illustrate how electric utilities can obtain an efficient and flexible utilization of the Digital Power Line Carrier (DPLC) technology with the narrow-band Asynchronous Transfer Mode (ATM) switching technology, implementing an innovative WAN for the internal requirements of vital operational communications.