ppxscal/embedding_network huggingface dataset:
Use of Publisher-Subscriber Design Pattern in Infrastructure of Distributed IDS Systems
Authors: Ilija Basicevic, Miroslav Popovic, Vladimir Kovacevic
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

In this paper we have approached one problem in development of distributed intrusion detection systems (IDS), namely realization of communications among its nodes. During the last few years, a significant trend towards building of highly distributed IDS systems could be noticed. In this situation a reliable communications solution that would enable updating of signature bases and alert notification is required. We propose use of subscriber-publisher design pattern for this purpose. Data schemes that could be used in this case are described.
Progress in approximate nash equilibria
Authors: Constantinos Daskalakis, Aranyak Mehta, Christos Papadimitriou
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

It is known [5] that an additively ε-approximate Nash equilibrium (with supports of size at most two) can be computed in polynomial time in any 2-player game with ε=.5. It is also known that no approximation better than .5 is possible unless equilibria with support larger than logn are considered, where n is the number of strategies per player. We give a polynomial algorithm for computing an ε-approximate Nash equilibrium in 2-player games with ε ≈ .38; our algorithm computes equilibria with arbitrarily large supports.
Modeling and improving data cache reliability: 1
Authors: Ismail Kadayif, Mahmut Kandemir
Venue: ACM SIGMETRICS Performance Evaluation Review (2007)

Soft errors arising from energetic particle strikes pose a significant reliability concern for computing systems, especially for those running in noisy environments. Technology scaling and aggressive leakage control mechanisms make the problem caused by these transient errors even more severe. Therefore, it is very important to employ reliability enhancing mechanisms in processor/memory designs to protect them against soft errors. To do so, we first need to model soft errors, and then study cost/reliability tradeoffs among various reliability enhancing techniques based on the model so that system requirements could be met. Since cache memories take the largest fraction of on-chip real estate today and their share is expected to continue to grow in future designs, they are more vulnerable to soft errors, as compared to many other components of a computing system. In this paper, we first focus on a soft error model for L1 data caches, and then explore different reliability enhancing mechanisms. More specifically, we define a metric called AVFC (Architectural Vulnerability Factor for Caches), which represents the probability with which a fault in the cache can be visible in the final output of the program. Based on this model, we then propose three architectural schemes for improving reliability in the existence of soft errors. Our first scheme prevents an error from propagating to the lower levels in the memory hierarchy by not forwarding the unmodified data words of a dirty cache block to the L2 cache when the dirty block is to be replaced. The second scheme proposed selectively invalidates cache blocks to reduce their vulnerable periods, decreasing their chances of catching any soft errors. Based on the AVFC metric, our experimental results show that these two schemes are very effective in alleviating soft errors in the L1 data cache. Specifically, by using our first scheme, it is possible to improve the AVFC metric by 32% without any performance loss. On the other hand, the second scheme enhances the AVFC metric between 60% and 97%, at the cost of a performance degradation which varies from 0% to 21.3%, depending on how aggressively the cache blocks are invalidated. To reduce the performance overhead caused by cache block invalidation, we also propose a third scheme which tries to bring a fresh copy of the invalidated block into the cache via prefetching. Our experimental results indicate that, this scheme can reduce the performance overheads to less than 1% for all applications in our experimental suite, at the cost of giving up a tolerable portion of the reliability enhancement the second scheme achieves.
Organizational Assimilation of Collaborative Information Technologies: Global Comparisons
Authors: Deepinder S. Bajwa, L. Floyd Lewis, Graham Pervan, Vincent Lai, Bjorn E. Munkvold, Gerhard Schwabe
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper reports on a global initiative to investigate the assimilation of collaborative information technologies (CITs) in task-oriented collaboration. The two classes of CITs explored include conferencing and groupware technologies. Based upon the level of technology access/availability and utilization, four assimilation states are identified. Data collected from 538 organizations in the US, Australia, Hong Kong, Norway, and Switzerland is mapped in the four CIT assimilation states. The results indicate that the assimilation patterns of conferencing and groupware technologies vary across the study regions. Overall analyses of the organizational antecedents of CIT assimilation indicate that function integration and promotion of collaboration are significantly associated with the assimilation of conferencing and groupware technologies. Organization size and information technology (IT) function size, on the other hand, were found to be significantly associated only with the assimilation of conferencing technologies. Implications of our findings are discussed for practice and research.
Content-based retrieval of FlashTM movies: research issues, generic framework, and future directions
Authors: Jun Yang, Qing Li, Liu Wenyin, Yueting Zhuang
Venue: Multimedia Tools and Applications (2007)

As a prevailing web media format, nowadays Flash¿ movies are created, delivered, and viewed by over millions of users in their daily experiences with the Internet. However, issues regarding the indexing and retrieval of Flash movies are unfortunately overlooked by the research community, which severely restrict the utilization of the extremely valuable Flash resource. A close examination reveals that the intrinsic complexity of a Flash movie, including its heterogeneous media components, its dynamic nature, and user interactivity, makes content-based Flash retrieval a host of research issues not thoroughly addressed by the existing techniques. As the first endeavor in this area, we propose a generic framework termed as FLAME (FLash Access and Management Environment) embodying a 3-layer structure that addresses the representation, indexing, and retrieval of Flash movies by mining and understanding of the movie content. An experimental prototype for Flash retrieval is implemented to verify the feasibility and effectiveness of FLAME, and future research directions on Flash management and retrieval are discussed in details.
From Local Laboratory Data to Public Domain Database in Search of Indirect Association of Diseases: AJAX Based Gene Data Search Engine
Authors: Nawaz Khan, Ham Long, Shahedur Rahman, Tony Stockman
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

This paper presents an extensible schema for capturing laboratory gene variance data with its meta-data properties in a semi-structured environment. This paper also focuses on the issues of creating a local and task specific component database which is a subset of global data resources. An XML based genetic disorder component database schema is developed with adequate flexibilities to facilitate searching of gene mutation data. A web based search engine is developed that allows researchers to query a set of gene parameters obtained from local XML schema and subsequently allow them to automatically establish a link with the public domain gene databases. The application applies AJAX (Asynchronous Javascript and XML), a cutting-edge web technology, to carry out the gene data searching function.
Location Prediction Methods with Markovian Approach and Extended Random Walk Model
Authors: Peter Fulop, Sandor Szabo, Tamas Szalka
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

Recent wireless networks offer more bandwidth than ever. High quality services are developed and provided by the operators, the number of users is constantly increasing. As the transferred data and the number of terminals are growing, the network providers have to face the increasing complexity of the network management and operation tasks. In this paper we observe one of the main problems that arise in a wireless network, the tracking of the users' mobility. We compare in detail the accuracy versus the complexity of mobility models serving for location prediction.
Transaction level modelling of SCA compliant software defined radio waveforms and platforms PIM/PSM
Authors: Grégory Gailliard, Eric Nicollet, Michel Sarlotte, François Verdier
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

In the scope of the US Department of Defense (DoD) Joint Tactical Radio System (JTRS) program, the portability and reconfigurability needs of Software Defined Radios (SDR) required by the Software Communications Architecture (SCA) [1] can be resolved thanks to Model Driven Architecture (MDA) and component/container paradigm to address a heterogeneous hardware and software architecture. In this paper, we propose SystemC Transaction Level Modelling (TLM) to simulate Platform Independent Model (PIM) and Platform Specific Model (PSM) of SDRs, while keeping the component/container approach for applications portability. We show that SystemC 2.1 enables natively to simulate the waveform PIM specified in UML to obtain an executable specification, which can be reused to validate the SystemC TLM model of PSM. This latter allows radio platform virtualisation and true reuse of IPs models to validate earlier SDR waveforms and platforms.
Packed integer wavelet transform constructed by lifting scheme
Authors: Chengjiang Lin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

A new method for speeding up the integer reversible wavelet transforms constructed by the lifting scheme is proposed. The proposed method packs multiple pixels (wavelet coefficients) in a single word; therefore, it can make use of the 32-bit or 64-bit computational capability of modern computers to accomplish multiple addition/subtraction operations in one instruction cycle. As a result, the proposed method can save the decomposition/reconstruction time by up to 37 percent on 32-bit machines in comparison with the original wavelet transform algorithms. Furthermore, the packed integer wavelet transform requires much less working memory.
Mostly accurate stack scanning
Authors: Katherine Barabash, Niv Buchbinder, Tamar Domani, Elliot K. Kolodner, Yoav Ossia, Shlomit S. Pinter, Janice Shepherd, Ron Sivan, Victor Umansky
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

The Java Virtual Machine (Jvm) needs, for the purpose of garbage collection (GC), to determine the data type stored in every memory location. Jvms that can do this reliably are said to be type-accurate (TA). Full type-accuracy usually exacts a price in performance due to the need to scan stacks and registers accurately. The mostly accurate approach presented here can reduce the TA overhead significantly by sacrificing accuracy for the small minority of memory locations that add the most to the cost. Performance results show that mostly accurate stack scanning performs as well as conservative stack scanning and that relatively few objects are identified conservatively. In addition our implementation is designed to support and generate type maps for any verifiable bytecode stream (including combinations that are unlikely to be produced by a compiler) without requiring rewriting of the bytecode. We introduce a new compression technique for type maps that uses a program-friendly format for the maps; yet, achieves good compression and provides fast opening of compressed maps. We show how to apply systematic testing techniques and test coverage tools to an accurate stack scanner.
Kitchen stories: sharing recipes with the Living Cookbook
Authors: Lucia Terrenghi, Otmar Hilliges, Andreas Butz
Venue: Personal and Ubiquitous Computing (2007)

Research on smart houses has mostly been focused on automation and invisible integration of technology, which may lead to a perceived loss of control and a sense of being observed. In our perspective users play an active and creative role, deliberately engaging with visible technology, not for reasons of efficiency, but rather for the fostering of social relations. In particular, we are looking at the kitchen environment, and we present the Living Cookbook. It enables people to share their cooking experiences, to educate others in the cooking practice, and to suggest a sense of presence and sociability. The cooking activity is reinterpreted as an experience, and the use of technology supports intimacy, communication, education, fun and creativity while cooking.
Automated collection strength analysis
Authors: Clare Lllewellyn, Robert Sanderson, Brian Rea
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

The strengths within six library collections were automatically determined through automated enrichment and analysis of bibliographic level metadata records, with a view towards efficient resource sharing and collaborative collection management. This involved very large scale deduplicantion, enrichment and automatic reclassification of records using machine learning processes.
DSP in genomics: processing and frequency-domain analysis of character strings
Authors: D. Anastassiou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

We demonstrate that digital signal processing of biomolecular sequences provides powerful approaches for solving highly relevant problems in bioinformatics by properly mapping character strings into numerical sequences. As examples, we show that color spectrograms visually provide, in the form of local texture, significant information about biomolecular sequences, thus facilitating understanding of local nature, structure and function; we provide an optimization procedure predicting protein-coding regions in DNA sequences including reading frame and coding direction, using both the magnitude and the phase of properly defined Fourier transforms; and we present a digital filtering approach to the process of translating nucleic acids into proteins. These approaches result in alternative mathematical formulations and often provide improved computational techniques for the solution of useful problems in genomic information science and technology.
The complexity of query containment in expressive fragments of XPath 2.0
Authors: Balder ten Cate, Carsten Lutz
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

Query containment has been studied extensively for fragments of XPath 1.0. For instance, the problem is known to be ExpTime-complete for CoreXPath, the navigational core of XPath 1.0. Much less is known about query containment in (fragments of) the richer language XPath 2.0. In this paper, we consider extensions of CoreXPath with the following operators, which are all part of XPath 2.0 (except the last): path intersection, path equality, path complementation, for-loops, and transitive closure. For each combination of these operators, we determine the complexity of query containment, both with and without DTDs. It turns out to range from ExpTime (for extensions with path equality) and 2-ExpTime (for extensions with path intersection) to non-elementary (for extensions with path complementation or for-loops). In almost all cases, adding transitive closure on top has no further impact on the complexity. We also investigate the effect of dropping the upward and/or sibling axes, and show that this sometimes leads to a reduction in complexity.Since the languages we study include negation and conjunction infilters, our complexity results can equivalently be stated in terms ofsatisfiability.We also analyze the above languages in terms of succinctness.
Slicing Communicating Automata Specifications for Efficient Model Reduction
Authors: Sebastien Labbe, Jean-Pierre Gallois, Marc Pouzet
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Slicing is a programanalysis technique, originally aimed at helping software engineers in program debugging. A slic- ing algorithm is intended to remove unnecessary state- ments, with respect to a criterion. Nowadays, slicing is be- coming more important on the specification level, for model reduction. Our contribution consists of a dependence-based solution to the problem of slicing communicating automata specifications, together with efficient algorithms to auto- matically extract slices. The resulting slicing tool -- named CARVER -- has shown to be operational in specification de- bugging and understanding. The model reduction results obtained with this tool are promising, notably in the area of formal validation and verification.
Collaborative classifier agents: studying the impact of learning in distributed document classification
Authors: Weimao Ke, Javed Mostafa, Yueyu Fu
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

We developed a multi-agent framework where agents had limited/distributed knowledge for document classification and collaborated with each other to overcome the knowledge distribution. Each agent was equipped with a certain learning algorithm for predicting potential collaborators, or helping agents. We conducted experimental research on a standard news corpus to examine the impact of two learning algorithms: Pursuit Learning and Nearest Centroid Learning. For a fundamental retrieval operation, namely classification, both algorithms achieved competitive classification effectiveness and efficiency. Subsequently, the impact of the learning exploration rate and the maximum collaboration range on classification effectiveness and efficiency were examined. Close investigation of agent learning dynamics revealed increasing and stabilizing patterns that were enhanced by the learning algorithms.
Wireless Temporal-Spatial Human Mobility Analysis Using Real-Time Three Dimensional Acceleration Data
Authors: Alex Kalpaxis
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

It is estimated that by the year 2010, the number of people over 65 years of age will reach 39 million. By 2030, that number is expected to over 70 million individuals in the 85 and older age group making them the fastest growing group of older individuals. Their growth rate is three times more than all of the 65 and older age groups put together. Falls and mobility issues are very common among older individuals and can have severe consequences. In older individuals, falls and mobility issues can occur as a result of normal age related changes such as changes in vision, gait, strength, disease progression, and medication. We introduce wireless microcontroller hardware and software that leverages micro electro mechanical system (MEMS) transducers which communicate with a server-based heuristics analytics system. The real-time heuristics analytics system performs correlation analysis which will allow for measuring and detecting of mobility related events correlated with, for example, specific disease progression and/or changes in medication dosing and scheduling. If there is excessive inactivity detected within a selected time period, notification will be sent by the heuristics analytics system to a response center.
And the winner is...Not the fittest [coevolution]
Authors: H. Bersini
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper carries out the study of natural networks (genetic, chemical and immune) evolving according to two levels of change called dynamics and metadynamics. The dynamics is the evolution in time of the concentration of the units currently present in the networks: the genetic, the molecular or the immune species. Their concentration evolves as a function of their network interaction with the other units. However, this evolution is also a function of their "exogenous" fitness so that the fitter units should in principle grow faster than the others. The metadynamics is the only way for innovation, and amounts to the generation of new units on the basis of the genetic or chemical materials constituting the units existing so far in the network. This metadynamics, indirectly subject to the exogenous pressure, tends to selectively favor units that are easier to produce from the existing ones. For instance, the genetic recombination of two species could occur between species presenting particular similar properties and thus generating new species merging these properties. This metadynamics also greatly influences the concentration of the units present in the network. The paper experimentally shows, on chemical, genetic and immune networks, that the interaction between these two levels of change, together with the intricate balance between the "exogenous" and the "network endogenous" selective drift, can induce a hard-to-predict concentration profile, subject to discontinuous changes.
A Failure Detection Service for Large-Scale Dependable Wireless Ad-Hoc and Sensor Networks
Authors: Mourad Elhadef, Azzedine Boukerche
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Dependable mobile ad-hoc networks are being designed to provide reliable and continuous service despite the failure of some of their components. One of the basic building blocks that has been identified for such fault tolerant systems is the failure detection service which aims at providing some information on which hosts have crashed. In this paper, we present a new implementation of a failure detection service for wireless ad-hoc and sensor systems that is based on an adaptation of a gossip-style failure detection protocol and the heartbeat failure detector. We show that our failure detector is eventually perfect-That is, it satisfies both properties: strong completeness and eventual strong accuracy. Strong completeness means that there is a time after which every faulty mobile is permanently suspected by every fault-free host. While, eventual strong accuracy refers to the fact that no host will be suspected before it crashes.