ppxscal/embedding_network huggingface dataset:
A low-power cache scheme for embedded computing
Authors: Yul Chu, Arul Sandeep Gade, Abhishek Bhaduri
Venue: Journal of Embedded Computing (2006)

This paper proposes an efficient cache scheme to reduce power consumption and conflict misses for single-core or multi-core embedded computing architecture. The proposed cache requires an additional gate stage before it accesses the cache line, which allows the use of a buffer to save the last memory reference. Each memory reference can be checked in the buffer before accessing the cache. If the data is in the buffer, the cache access can be aborted to reduce power consumption. Our simulation results show that it can reduce power consumption, access penalty, and cache misses significantly compared to other conventional caches such as direct-mapped and 2-way set-associative.
Coordinating Autonomous Agents for Force Protection Using Contract Net
Authors: Richard J. Martelli, Larbi Esmahi
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

The survivability of a naval surface combatant depends largely on the effective management of combat resources. In terms of platform-centric self-protection, situation assessment strategies and engagement policies governing weapon usage influence effective management. Situation assessment strategies enable the surface combatant to adapt to changes in the battlespace. In the case of network-centric operations, the task force's ability to adapt to changes in the battlespace relies on the information superiority gained through shared awareness. Although shared awareness enables surface combatants to apply situation assessment strategies to self-synchronize to the situation, engagement policies governing weapons usage typically remain platform-centric and rely on centralized command structures to provide overall coordination.The research presented, herein, examines the implementation of intelligent agents to create a partially centralized, distributed command structure that uses Contract Nets to coordinate tactical responses across the task force.
LRTG: Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems
Authors: Kai Han, Binoy Ravindran, E. D. Jensen
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

We consider scheduling distributed real-time tasks in unreliable (e.g., those with arbitrary node and network failures) and untrustworthy systems (e.g., those with Byzantine node behaviors). We present a distributed real-time scheduling algorithm called LRTG. The algorithm makes two novel contributions. First, LRTG uses gossip for reliably propagating task scheduling parameters and for discovering task execution nodes. Second, the algorithm guards against potential disruption of message propagation due to Byzantine attacks using a mechanism called LASIRC. By doing so, the algorithm provides assurances on task timeliness behaviors, despite system unreliability and untrustworthiness. Our performance evaluation shows LRTG's effectiveness.
Discrete time dynamic multi-leader-follower games with feedback perfect information
Authors: Pu-yan Nie
Venue: International Journal of Systems Science (2007)

Both Stackelberg games and Nash games play extremely important roles in such fields as economics, management, politics and behavioral sciences. Stackelberg game can be modelled as a bilevel optimization problem. Static multi-leader-follower optimization problems are initially proposed by Pang and Fukushima. In this article, a discrete time dynamic version of multi-leader-follower games with feedback information is given and analyzed. There are two major contributions in this article. On one hand, based on the multi-leader-follower games, discrete time dynamic multi-leader-follower games are proposed. On the other hand, dynamic programming algorithms are presented to attack discrete time dynamic multi-leader-follower games with multi-players under feedback information structure for dependent followers.
Engaging the Business/Industrial Sector in Accessibility Research: Lessons in Bridge Building
Authors: Aldred H. Neufeldt, James Watzke, Gary Birch, Denise Buchner
Venue: The Information Society (2007)

This article examines challenges of engaging the business/industry sector in research on the use of information technology to enhance accessibility for people with disabilities in two areas of common interest-to employment and to public and retail services. The data presented arise from the joint effort of two research teams who independently encountered challenges in engaging private sector firms in their respective projects. Using a case study approach, the experiences of both groups were examined for themes representing factors that inhibited collaboration between research and business sectors, and those that enhanced collaboration. Trustworthiness of themes was established by submitting them for critique and feedback to key informants knowledgeable in both business and research. From a social systems theory perspective, findings suggest that the most important differences between research and business systems reside in the meaning of communication each uses, and differences in assumptions about and value placed on factors such as pursuit of new knowledge, the importance of marketability of findings, and so on. Additional complications arise in pursuit of research related to disability. Factors to build on when seeking research collaboration include an understanding of the language and culture of business systems, and the very real possibility of developing disability research into secondary goals that business systems typically pursue once the prime need for profitability has been at addressed (the notion of satisficing). Implications for communication between disability research and business systems are identified.
A pommaret division algorithm for computing Grobner bases in boolean rings
Authors: Vladimir P. Gerdt, Mikhail V. Zinin
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

In this paper an involutive algorithm for construction of Grobner bases in Boolean rings is presented. The algorithm exploits the Pommaret monomial division as an involutive division. In distinction to other approaches and due to special properties of Pommaret division the algorithm allows to perform the Grobner basis computation directly in a Boolean ring which can be defined as the quotient ring F2[x1,...,xn],12+x1,...,xn2+xn>. Some related cardinality bounds for Pommaret and Grobner bases are derived. Efficiency of our first implementation of the algorithm is illustrated by a number of serial benchmarks.
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Venue: International Symposium on Mobile Ad Hoc Networking Computing (2008)

Welcome all to ACM MobiHoc 2008 in beautiful and vibrant Hong Kong! Over its short eight-year history, MobiHoc has established itself as the premier symposium dedicated to addressing the important and emerging challenges in wireless communication networks. This year, MobiHoc received a near-record 300 submissions from universities, government and industrial research labs, and companies from several different countries around the world. Thus, demonstrating the world-wide attention it enjoys, and its continued importance as a venue for cutting-edge wireless research. Each submitted paper to MobiHoc 2008 was reviewed by at least three technical program committee (TPC) members, followed by an extensive email discussion of the papers. Based on the reviews and the email discussion, preliminary decisions were made on accepting or rejecting the papers, and identifying papers that required further discussion. The TPC meeting was held in Chicago at the Illinois Institute of Technology campus on Feb. 16, 2008 and was attended by 24 TPC members. The papers to be discussed were distributed to two groups, and an all-day meeting was held to decide on which papers to include in the final program. The final outcome was that a total of 44 high quality papers were accepted for the program, resulting in a highly-competitive acceptance ratio of less than 15%. A Best-Paper Award committee was formed by the TPC chairs. The committee was given a set of the top-ranked conference papers to review. The Best Paper Award was given to one of these papers based on its originality, novelty, and significance. The winner will be announced at the plenary session of the conference and advertised on the conference web page. It is perhaps one of the greatest regrets of the TPC chairs that due to the large number of submitted papers, many high quality papers were not accepted. We hope that the authors of these papers found the reviews both constructive and useful. Further, in a symposium of this size and complexity mistakes may have been made during the review process for which we take responsibility with apologies to those affected.
Algorithm 878: Exact VARMA likelihood and its gradient for complete and incomplete data with Matlab
Authors: Kristjan Jonasson
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

Matlab functions for the evaluation of the exact log-likelihood of VAR and VARMA time series models are presented (vector autoregressive moving average). The functions accept incomplete data, and calculate analytical gradients, which may be used in parameter estimation with numerical likelihood maximization. Allowance is made for possible savings when estimating seasonal, structured or distributed lag models. Also provided is a function for creating simulated VARMA time series that have an accurate distribution from term one (they are spin-up free). The functions are accompanied by a a simple example driver, a program demonstrating their use for real parameter fitting, as well as a test suite for verifying their correctness and aid further development. The article concludes with description of numerical results obtained with the algorithm.
Edge-Preserving Filtering of Images with Low Photon Counts
Authors: John A. Lee, Xavier Geets, Vincent Grégoire, Anne Bol
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

EEdge-preserving filters such as local M-smoothers or bilateral filtering are usually designed for Gaussian noise. This paper investigates how these filters can be adapted in order to efficiently deal with Poissonian noise. In addition, the issue of photometry invariance is addressed by changing the way filter coefficients are normalized. The proposed normalization is additive, instead of being multiplicative, and leads to a strong connection with anisotropic diffusion. Experiments show that ensuring the photometry invariance leads to comparable denoising performances in terms of the root mean square error computed on the signal.
Schottky barrier heights of n/p-type erbium-silicided schottky diodes
Authors: Myungsim Jun, Yarkyeon Kim, Cheljong Choi, Taeyoub Kim, Soonyoung Oh, Moongyu Jang
Venue: Microelectronic Engineering (2008)

The Schottky barrier heights for electrons and holes of erbium-silicided Schottky diodes were extracted from the current-voltage-temperature characteristics in reverse bias condition. The effective barrier heights increased with temperature. The highest effective barrier heights for electrons and holes were extracted to be 0.38eV and 0.67eV at the high temperatures, respectively. The effective barrier heights may be close to the temperature-independent barrier heights of erbium-silicided Schottky diodes since the sum of the two barrier heights for electrons and holes is close to the bandgap of silicon and the conduction mechanisms of carriers can be explained by the pure thermionic emission model at the high temperatures.
Energy-constrained optimal quantization for wireless sensor networks
Authors: Xiliang Luo, Georgios B. Giannakis
Venue: EURASIP Journal on Advances in Signal Processing (2008)

As low power, low cost, and longevity of transceivers are major requirements in wireless sensor networks, optimizing their design under energy constraints is of paramount importance. To this end, we develop quantizers under strict energy constraints to effect optimal reconstruction at the fusion center. Propagation, modulation, as well as transmitter and receiver structures are jointly accounted for using a binary symmetric channel model. We first optimize quantization for reconstructing a single sensor's measurement, and deriving the optimal number of quantization levels as well as the optimal energy allocation across bits. The constraints take into account not only the transmission energy but also the energy consumed by the transceiver's circuitry. Furthermore, we consider multiple sensors collaborating to estimate a deterministic parameter in noise. Similarly, optimum energy allocation and optimum number of quantization bits are derived and tested with simulated examples. Finally, we study the effect of channel coding on the reconstruction performance under strict energy constraints and jointly optimize the number of quantization levels as well as the number of channel uses.
Figure-ground separation by cue integration
Authors: Xiangyu Tang, Christoph von der Malsburg
Venue: Neural Computation (2008)

This letter presents an improved cue integration approach to reliably separate coherent moving objects from their background scene in video sequences. The proposed method uses a probabilistic framework to unify bottom-up and top-down cues in a parallel, “democratic” fashion. The algorithm makes use of a modified Bayes rule where each pixel's posterior probabilities of figure or ground layer assignment are derived from likelihood models of three bottom-up cues and a prior model provided by a top-down cue. Each cue is treated as independent evidence for figure-ground separation. They compete with and complement each other dynamically by adjusting relative weights from frame to frame according to cue quality measured against the overall integration. At the same time, the likelihood or prior models of individual cues adapt toward the integrated result. These mechanisms enable the system to organize under the influence of visual scene structure without manual intervention. A novel contribution here is the incorporation of a top-down cue. It improves the system's robustness and accuracy and helps handle difficult and ambiguous situations, such as abrupt lighting changes or occlusion among multiple objects. Results on various video sequences are demonstrated and discussed. (Video demos are available at <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="url" xlink="http://organic.usc.edu:8376/~tangx/neco/index.html">http://organic.usc.edu:8376/∼tangx/neco/index.html</ext-link>.)
Extremism Propagation in Social Networks with Hubs
Authors: Daniel W. Franks, Jason Noble, Peter Kaufmann, Sigrid Stagl
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2008)

One aspect of opinion change that has been of academic interest is the impact of people with extreme opinions (extremists) on opinion dynamics. An agent-based model has been used to study the role of small-world social network topologies on general opinion change in the presence of extremists. It has been found that opinion convergence to a single extreme occurs only when the average number of network connections for each individual is extremely high. Here, we extend the model to examine the effect of positively skewed degree distributions, in addition to small-world structures, on the types of opinion convergence that occur in the presence of extremists. We also examine what happens when extremist opinions are located on the well-connected nodes (hubs) created by the positively skewed distribution. We find that a positively skewed network topology encourages opinion convergence on a single extreme under a wider range of conditions than topologies whose degree distributions were not skewed. The importance of social position for social influence is highlighted by the result that, when positive extremists are placed on hubs, all population convergence is to the positive extreme even when there are twice as many negative extremists. Thus, our results have shown the importance of considering a positively skewed degree distribution, and in particular network hubs and social position, when examining extremist transmission.
The myth of the folk theorem
Authors: Christian Borgs, Jennifer Chayes, Nicole Immorlica, Adam Tauman Kalai, Vahab Mirrokni, Christos Papadimitriou
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

A well-known result in game theory known as "the Folk Theorem" suggests that finding Nash equilibria in repeated games should be easier than in one-shot games. In contrast, we show that the problem of finding any (approximate) Nash equilibrium for a three-player infinitely-repeated game is computationally intractable (even when all payoffs are in {-1,0,1}), unless all of PPAD can be solved in randomized polynomial time. This is done by showing that finding Nash equilibria of (k+1)-player infinitely-repeated games is as hard as finding Nash equilibria of k-player one-shot games, for which PPAD-hardness is known (Daskalakis, Goldberg and Papadimitriou, 2006; Chen, Deng and Teng, 2006; Chen, Teng and Valiant, 2007). This also explains why no computationally-efficient learning dynamics, such as the "no regret" algorithms, can be "rational" (in general games with three or more players) in the sense that, when one's opponents use such a strategy, it is not in general a best reply to follow suit.
Security for Telecommunications Networks, 1 edition
Authors: Patrick Traynor, Patrick McDaniel, Thomas La Porta
Venue:  (2008)

Telecommunications networks are a critical component of the economic and social infrastructures in which we live. Each day, well over three billion people across the globe rely upon these systems, as their primary means of connecting to the world around them. Given the significant focus on securing critical infrastructure in recent years, Securityfor Telecommunications Networks creates a starting place for new researchers in the field of secure telecommunications networks.Thisvolumenot only discusses emerging threats, along with system vulnerability, but also presents the open questions posited by network evolution and defense mechanisms. This is one of the first books to discuss securing current and next generation telecommunications networks by the security community. Securityfor Telecommunications Networks is designed for a professional audience composed of practitioners and researchers in industry. This book is also suitable as a secondary text book or reference for advanced-level students in computer science and electrical engineering.
Recurrent neural network based BER prediction for NLOS channels
Authors: Gowrishankar, P. S. Satyanarayana
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Bit error rate (BER) will enumerate the Channel State Information (CSI) in wireless network. Accurate and timely estimation of CSI will guarantee the Quality of Service (QoS) by admission control, inter and intra network handovers. Here the BER of time varying Non line of Sight (NLOS) channels are predicted by neural network system. The wireless channel is modeled as time variant nonlinear system. The neural network systems are the best suitable paradigm to predict and analyze the behaviors of time varying nonlinear system. In this framework BER is predicted by two different recurrent neural network architectures such as Recurrent Radial Basis Function Network (RRBFN) and Echo state network (ESN).
An efficient filter for approximate membership checking
Authors: Kaushik Chakrabarti, Surajit Chaudhuri, Venkatesh Ganti, Dong Xin
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

We consider the problem of identifying sub-strings of input text strings that approximately match with some member of a potentially large dictionary. This problem arises in several important applications such as extracting named entities from text documents and identifying biological concepts from biomedical literature. In this paper, we develop a filter-verification framework, and propose a novel in-memory filter structure. That is, we first quickly filter out sub-strings that cannot match with any dictionary member, and then verify the remaining sub-strings against the dictionary. Our method does not produce false negatives. We demonstrate the efficiency and effectiveness of our filter over real datasets, and show that it significantly outperforms the previous best-known methods in terms of both filtering power and computation time.
The networking shape of vehicular mobility
Authors: Marco Fiore, Jérôme Härri
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Mobility is the distinguishing feature of vehicular networks, affecting the evolution of network connectivity over space and time in a unique way. Connectivity dynamics, in turn, determine the performance of networking protocols, when they are employed in vehicle-based, large-scale communication systems. Thus, a key question in vehicular networking is: which effects does nodes mobility generate on the topology of a network built over vehicles? Surprisingly, such a question has been quite overlooked by the networking research community. In this paper, we present an in-depth analysis of the topological properties of a vehicular network, unveiling the physical reasons behind the peculiar connectivity dynamics generated by a number of mobility models. Results make one think about the validity of studies conducted under unrealistic car mobility and stimulate interesting considerations on how network protocols could take advantage of vehicular mobility to improve their performance.
Redress and Alternative Dispute Resolution in EU Cross-Border E-Commerce Transactions
Authors: Lilian Edwards, Caroline Wilson
Venue: International Review of Law, Computers and Technology (2007)

Effective dispute settlement is regarded as one of the means of enhancing consumer confidence in cross-border purchases over the Internet. Yet, studies of online dispute resolution (ODR) show, on the whole, poor uptake of ODR by the public. This paper is based on a research project carried out by the authors (funded by the European Parliament) which explored why so few people resort to ODR and what are the implications of low uptake for consumer confidence in cross-border e-commerce. The authors expand the traditional definition of ODR and introduce a distinction between what they term 'hard' or traditional ODR processes and the more novel 'soft' ODR processes. The low uptake of 'hard' ODR is critically considered, as are the theoretical advantages and disadvantages of 'hard' and 'soft' ODR. Successful examples of one 'hard' and one 'soft' ODR mechanism are reviewed. The authors conclude with considering the implications for EU ODR policy in the short, medium and long term.