ppxscal/embedding_network huggingface dataset:
Uisce: an alternative approach to end-to-end delivery in manets
Authors: Guoxian Yang, Stefan Weber
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

The goal of communication in computer networks is the delivery of information to endpoints that have certain properties. In wired networks, identities such as IP addresses are used to guide information through a network and the properties of network nodes are mapped to these identities by service discovery mechanisms. In mobile ad hoc networks(MANETs), identities lose their guiding ability because of the mobility of nodes. Instead of identities, we introduce a concept called characteristics, describing properties of nodes. Characteristics are disseminated throughout a network, simulating the flow of water streams. Messages are forwarded to their destinations - nodes with given properties - following these characteristics like following a water stream to its source. Messages may leave characteristics along their forwarding path which may be used to communicate with their sender and thus to establish two-way communication. In the following, we describe the details of our proposed protocol and compare it against traditional identity-based alternatives.
Interactive broadcast services for live soccer video based on instant semantics acquisition
Authors: Xinguo Yu, Liyuan Li, Hon Wai Leong
Venue: Journal of Visual Communication and Image Representation (2009)

This paper presents a system for providing interactive broadcast services for live soccer video that is based on instant semantics acquisition. Currently, we have implemented two such interactive services: live event alert and on-the-fly language selection. The live event alert service has a small time lag of about 30s for a short video clip to reach its final viewer and at most 1.5min for a long clip of the live event. The on-the-fly language selection service allows users to choose their preferred contents and preferred language. The motivation for this work is that such interactive services will greatly increase the value of live soccer video. Currently, similar systems attempt to derive semantics of a soccer game from gamelog in freestyle text format and low-level features of the video, which is a challenging task. In this paper, we tackle this challenge with a combination of both gamelog input tool and targeted algorithm proposed in this paper. Our system is powered by our proposed semantic gamelog input tool that facilitates fast and accurate input of a semantic gamelog that contains basic semantic information of atomic events. When an interesting event occurs, our system performs boundary detection of these events by combining features extracted from the video with additional information from the semantic gamelog. This additional information facilitates our system to achieve accurate and very fast boundary detection of these events to support our live event alert service. Our system also implements a gamelog translation machine which translates the semantic gamelog (encoded in a game-specific code) into any natural language, provided that there is a configuration file for that language. Combining our gamelog translation machine with existing text-to-speech technology, we provide the on-the-fly language selection service. (Currently, our system supports English, Chinese, and Malay.)
Memory-Centric Security Architecture
Authors: Weidong Shi, Chenghuai Lu, Hsien-Hsin S. Lee
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

This article presents a new security model called MESA for protecting software confidentiality and integrity. Different from the previous process-centric systems designed for the same purpose, MESA ties cryptographic properties and security attributes to memory instead of each individual user process. The advantages of such a memory-centric design over the process-centric designs are many folds. First, it allows better access control on software privacy, which supports both selective and mixed tamper resistant protection on software components coming from heterogenous sources. Second, the new model supports and facilities tamper resistant secure information sharing in an open software system where both data and code components could be shared by different user processes. Third, the proposed security model and secure processor design allow software components protected with different security policies to inter-operate within the same memory space efficiently. The architectural support for MESA requires small silicon resources and its performance impact is minimal based on our experimental results using commercial MS Windows workloads and cycle based out-of-order processor simulator.
Software Verification and Analysis: An Integrated, Hands-On Approach, 1 edition
Authors: Janusz Laski, William Stanley
Venue:  (2009)

This book addresses the most important techniques in improving the correctness of software, including correctness by construction (top-down refinement), program proving, static analysis and dynamic, execution-based analysis (testing and debugging). Three major software verification techniques are discussed: Semantic program synthesis and analysis, static program analysis and dynamic program analysis. The correctness by construction paradigm is illustrated using the VDM-SL and the corresponding CSK Toolbox. The discussion involves the synthesis of direct and/or indirect specification, interpreting the latter and carrying out high-level testing of the specification. Problems are included in the text and one or more difficult exercises appear at the end of each chapter. Also, where appropriate, STADs handling of the concepts is illustrated. Written for advanced students and professionals wishing to explore more than one technique, this comprehensive text will be invaluable with its unique integrated approach.
New Fast Decision Tree Classifier for Identifying Protein Coding Regions
Authors: Hazem M. El-Bakry, Mohamed Hamada
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

In this paper, a fast tool for finding protein coding regions is presented. Such tool relies on performing cross correlation in the frequency domain and decision Tree. In addition, a modified trust region method is used to find the closet (optimized) DNA nucleotide. Moreover, a Sequential PRM-based protein folding algorithm for finding the point where these proteins add to the ladder is introduced. Furthermore, standard parallel scan algorithm is used to provide parallel processing of the strides and its transitions. This proposed tool produces more accurate results, than that have previously been obtained for a range of different sequence lengths. Experimental results confirm the scalability of the proposed classifying tool to handle large volume of datasets irrespective of the number of classes, tuples and attributes. High classification accuracy is achieved. The main achievement in this paper is the fast decision tree algorithm. Such algorithm relies on performing cross correlation in the frequency domain between the input data at each node and the input weights of neural networks. It is proved mathematically and practically that the number of computation steps required for the presented FNNs is less than that needed by conventional neural networks (CNNs). Simulation results using MATLAB confirm the theoretical computations.
Systems performance/measurements: a quantitative base for management of computer systems
Authors: Paul Malick
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Systems Performance/Measurements is a new area of computer technology which provides a quantitative base for management of data processing systems. This function has generated high interest due to increasing emphasis on cost effective management of these data processing systems.
Static Timing Model Extraction for Combinational Circuits
Authors: Bing Li, Christoph Knoth, Walter Schneider, Manuel Schmidt, Ulf Schlichtmann
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

For large circuits, static timing analysis (STA) needs to be performed in a hierarchical manner to achieve higher performance in arrival time propagation. In hierarchical STA, efficient and accurate timing models of sub-modules need to be created. We propose a timing model extraction method that significantly reduces the size of timing models without losing any accuracy by removing redundant timing information. Circuit components which do not contribute to the delay of any input to output pair are removed. The proposed method is deterministic. Compared to the original models, the numbers of edges and vertices of the resulting timing models are reduced by 84% and 85% on average, respectively, which are significantly more than the results achieved by other methods.
Flexible and scalable storage management for data-intensive stream processing
Authors: Irina Botan, Gustavo Alonso, Peter M. Fischer, Donald Kossmann, Nesime Tatbul
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Data Stream Management Systems (DSMS) operate under strict performance requirements. Key to meeting such requirements is to efficiently handle time-critical tasks such as managing internal states of continuous query operators, traffic on the queues between operators, as well as providing storage support for shared computation and archived data. In this paper, we introduce a general purpose storage management framework for DSMSs that performs these tasks based on a clean, loosely-coupled, and flexible system design that also facilitates performance optimization. An important contribution of the framework is that, in analogy to buffer management techniques in relational database systems, it uses information about the access patterns of streaming applications to tune and customize the performance of the storage manager. In the paper, we first analyze typical application requirements at different granularities in order to identify important tunable parameters and their corresponding values. Based on these parameters, we define a general-purpose storage management interface. Using the interface, a developer can use our SMS (Storage Manager for Streams) to generate a customized storage manager for streaming applications. We explore the performance and potential of SMS through a set of experiments using the Linear Road benchmark.
Improving the characterization of the alternative hypothesis via minimum verification error training with applications to speaker verification
Authors: Yi-Hsiang Chao, Wei-Ho Tsai, Hsin-Min Wang, Ruei-Chuan Chang
Venue: Pattern Recognition (2009)

Speaker verification is usually formulated as a statistical hypothesis testing problem and solved by a log-likelihood ratio (LLR) test. A speaker verification system's performance is highly dependent on modeling the target speaker's voice (the null hypothesis) and characterizing non-target speakers' voices (the alternative hypothesis). However, since the alternative hypothesis involves unknown impostors, it is usually difficult to characterize a priori. In this paper, we propose a framework to better characterize the alternative hypothesis with the goal of optimally distinguishing the target speaker from impostors. The proposed framework is built on a weighted arithmetic combination (WAC) or a weighted geometric combination (WGC) of useful information extracted from a set of pre-trained background models. The parameters associated with WAC or WGC are then optimized using two discriminative training methods, namely, the minimum verification error (MVE) training method and the proposed evolutionary MVE (EMVE) training method, such that both the false acceptance probability and the false rejection probability are minimized. Our experiment results show that the proposed framework outperforms conventional LLR-based approaches.
The Cyber Threat to National Critical Infrastructures: Beyond Theory
Authors: Kenneth Geers
Venue: Information Security Journal: A Global Perspective (2009)

Adversary threats to critical infrastructures have always existed during times of conflict, but threat scenarios now include peacetime attacks from anonymous computer hackers. Current events, including examples from Israel and Estonia, prove that a certain level of real-world disorder can be achieved from hostile data packets alone. The astonishing achievements of cyber crime and cyber espionage-to which law enforcement and counterintelligence have found little answer-hint that more serious cyber attacks on critical infrastructures are only a matter of time. Still, national security planners should address all threats with method and objectivity. As dependence on IT and the Internet grow, governments should make proportional investments in network security, incident response, technical training, and international collaboration.
Using Templates to Attack Masked Montgomery Ladder Implementations of Modular Exponentiation
Authors: Christoph Herbst, Marcel Medwed
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

Since side-channel attacks turned out to be a major threat against implementations of cryptographic algorithms, many countermeasures have been proposed. Amongst them, multiplicative blinding is believed to provide a reasonable amount of security for public-key algorithms. In this article we show how template attacks can be used to extract sufficient information to recover the mask. Our practical experiments verify that one power trace suffices in order to remove such a blinding factor. In the course of our work we attacked a protected Montgomery Powering Ladder implementation on a widely used microcontroller. As a result we can state that the described attack could be a serious threat for public key algorithms implemented on devices with small word size.
European R & D and Standardization in the Multimedia Domain: A Symbiotic Relationship
Authors: Augusto de Albuquerque, Carlos Morais Pires
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

European R & D programmes in Telecommunication and Information Technology, managed by the European Commission Services, are about to start a new phase. The Information Society Technolgies programme brings to the foreground the concept of convergence between technologies but also between technology and the commercial and regulatory requirements to enable open blobal markets. The former industrial pre-competitive European R & D programmes, RACE (Research and Development in Advanced Communication in Europe) and ACTS (Advanced Communications Technologies and Services), maintained a strong symbiotic relationship with standardization. Through mechanisms put in place during the lifetime of the programme the various research projects were clustered in concertation groups to harmonize approaches leading to clear and stronger contributions in the different standardization organization/consortia.Important debates took place recently concerning the adaptation of the role of standardization to the specific demands of today's industrial and market realities in the various domains. The expectations are that standardization in the networked multimedia domain works as enabler of market openness and fairness, public interest and social-cultural awareness (in the sense of taking into account the end-user as an individual or community) leading to a non-obstructive competitive attitude. All of this high level concepts apply to the willingness to build an open and fair market in Europe and, at the same time, to work towards a global market where European companies have been increasingly involved.This paper lists a non exhaustive set of points in the Telecommunication and information Technology where we believe R & D and standardization must find a sustained input/output flow of background technological work and consensus-building mechanisms to achieve the above mentioned objectives. It goes without saying that timeliness, credibility, transparency, scalability of the proposed solutions and industrial commitment, probably more than ever before in this area of knowledge and technology, become critical issues of this interactive flow.
Teaching basic game programming using JavaScript
Authors: Penn Wu
Venue: Journal of Computing Sciences in Colleges (2009)

JavaScript is a sophisticated modern object-based scripting language. Although it has technical restrictions, it has sufficient features to create Web games, or games people play through the Web. Using JavaScript students can learn the concepts and immediately present their web games to the Web. This paper reports how the author successfully uses JavaScript to teach basic key concepts in a college-level introductory course of game programming.
Network Attack-Defense Simulation Training System Based on HLA
Authors: Gang Chen, Shang Xiang, GuanQun Ji, YiLong Jia
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Soldiers possessing of network attack-defense ability are the key factor for future information war. Aiming at the problem of lacking daily training and drilling environment, a method of building Network Attack-Defense Simulation Training System (NADSTS) based on HLA is put forward. With the method, attack and defense training are designed as different federation member. The system is divided to presentation, application and adapter layer clearly. Key technologies involves network attack-defense, network simulation and simulation driving are also presented. Software is developed based on plug-in framework. Its simulation examples show greatest traits on building similar large-scale simulation system.
Multi-criteria sequence-dependent job shop scheduling using genetic algorithms
Authors: Andrew Manikas, Yih-Long Chang
Venue: Computers and Industrial Engineering (2009)

Real world job shops have to contend with jobs due on different days, material ready times that vary, reentrant workflows and sequence-dependent setup times. The problem is even more complex because businesses often judge solution goodness according to multiple competing criteria. Producing an optimal solution would be time consuming to the point of rendering the result meaningless. Commonly used heuristics such as shortest processing time (SPT) and earliest due date (EDD) can be used to calculate a feasible schedule quickly, but usually do not produce schedules that are close to optimal in these job shop environments. We demonstrate that genetic algorithms (GA) can be used to produce solutions in times comparable to common heuristics but closer to optimal. Changing criteria or their relative weights does not affect the running time, nor does it require programming changes. Therefore, a GA can be easily applied and modified for a variety of production optimization criteria in a job shop environment that includes sequence-dependent setup times.
An Instance vs. The Instance
Authors: Kumiko Tanaka-Ishii
Venue: Minds and Machines (2009)

This article argues how one problem of computing lies in realizing a significant instance given a class or type. Analysis of a case study on digital narrative suggests two general processes for instantiating significant instances: interaction and optimization. The article then explains how the problem of universals needs to be deconstructed when trying to understand what type of entities significant instances are and what the process for obtaining them is.
Top-k dominant web services under multi-criteria matching
Authors: Dimitrios Skoutas, Dimitris Sacharidis, Alkis Simitsis, Verena Kantere, Timos Sellis
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

As we move from a Web of data to a Web of services, enhancing the capabilities of the current Web search engines with effective and efficient techniques for Web services retrieval and selection becomes an important issue. Traditionally, the relevance of a Web service advertisement to a service request is determined by computing an overall score that aggregates individual matching scores among the various parameters in their descriptions. Two drawbacks characterize such approaches. First, there is no single matching criterion that is optimal for determining the similarity between parameters. Instead, there are numerous approaches ranging from using Information Retrieval similarity metrics up to semantic logic-based inference rules. Second, the reduction of individual scores to an overall similarity leads to significant information loss. Since there is no consensus on how to weight these scores, existing methods are typically pessimistic, adopting a worst-case scenario. As a consequence, several services, e.g., those having a single unrelated parameter, can be excluded from the result set, even though they are potentially good alternatives. In this work, we present a methodology that overcomes both deficiencies. Given a request, we introduce an objective measure that assigns a dominance score to each advertised Web service. This score takes into consideration all the available criteria for each parameter in the request. We investigate three distinct definitions of dominance score, and we devise efficient algorithms that retrieve the top-k most dominant Web services in each case. Extensive experimental evaluation on real requests and relevance sets, as well as on synthetically generated scenarios, demonstrates both the effectiveness of the proposed technique and the efficiency of the algorithms.
Purely Rational Secret Sharing (Extended Abstract)
Authors: Silvio Micali, Abhi Shelat
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

Rational secret sharing is a problem at the intersection of cryptography and game theory. In essence, a dealer wishes to engineer a communication game that, when rationally played, guarantees that each of the players learns the dealer's secret. Yet, all solutions proposed so far did not rely solely on the players' rationality, but also on their beliefs, and were also quite inefficient.After providing a more complete definition of the problem, we exhibit a very efficient and purely rational solution to it with a verifiable trusted channel.
Mean field approximation for PDE-Markov random field models in image analysis
Authors: S. Zimeras
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

Markov random fields (M.R.F.) on a lattice system and Gibbs distribution provide a wide area of models for interacting particle systems in image analysis, mechanical physics and statistical mechanics. Physical properties of the neighbors could be explained by partial differential equation (PDE) inside the potential function introducing PDE-MRF models. In image analysis, they have been used to describe the local characteristics of the spatial interaction between pixels. Although, in model image reconstruction, a number of fundamental issues remain unexplored, such as the specification of M.R.F. models, performance evaluation of the neighborhood structure of these models, and the phase transition phenomenon. In this work, spatial behavior of the auto-exponential model in a rectangular lattice would be investigated, concentrating on the first-order neighborhood structures. A simple deterministic model based on a univariate iterative scheme is studied which predicts the properties of these models and realizations have been generating using the Gibbs sampler to illustrate the properties. For well defined regions in the parameter space this iterative scheme is unstable leading to catastrophic and 2-cycle behavior.