ppxscal/embedding_network huggingface dataset:
Towards a Generic Payment Framework for Internet Media-on-Demand Services Based on RTSP
Authors: Antonio Ruiz-Martínez, Juan A. Sánchez-Laguna, Antonio F. Gómez-Skarmeta
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Broadband connections to Internet make possible offering new services such as Multimedia on Demand (MoD). To the date, content providers and distributors resort to use specifically developed software to deal with payments. The problem is that those customized solutions are limited to either a specific payment protocol, brand and payment service provider, or a determinate architecture or a concrete business model. Moreover, at the moment, there is not any general framework to make payments as a part of the MoD service. In this paper we propose a new generic payment framework for Internet MoD Services based on RTSP which, being a payment-independent protocol, solves interoperability problems and links payment information with content requests. Our framework extends both SDP and RTSP to facilitate the access to pay-per-view MoD. It supports an offer/answer model that allows the choice of he quality of the streams and the payment method. Furthermore, it is extensible and not only supports payments but also more complex business models. Thus, we facilitate the incorporation of new payment methods and business models in vendor’s software.
Efficient, incremental coverage of space with a continuous curve
Authors: Subramanian Ramamoorthy, Ram Rajagopal, Lothar Wenzel
Venue: Robotica (2008)

This paper is concerned with algorithmic techniques for the incremental generation of continuous curves that can efficiently cover an abstract surface. We introduce the notion of low-discrepancy curves as an extension of the notion of low-discrepancy sequences—such that sufficiently smooth curves with low-discrepancy properties can be defined and generated. We then devise a procedure for lifting these curves, that efficiently cover the unit cube, to abstract surfaces, such as nonlinear manifolds. We present algorithms that yield suitable fair mappings between the unit cube and the abstract surface. We demonstrate the application of these ideas using some concrete examples of interest in robotics.
WAP: Wormhole Attack Prevention Algorithm in Mobile Ad Hoc Networks
Authors: Sun Choi, Doo-young Kim, Do-hyeon Lee, Jae-il Jung
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

In wireless ad hoc networks, nodes compromise to forward packets for each other to communicate beyond their transmission range. Therefore, networks are vulnerable to wormhole attacks launched through compromised nodes because malicious nodes can easily participate in the networks. In wormhole attacks, one malicious node tunnels packets from its location to the other malicious node. Such wormhole attacks result in a false route with fewer. If source node chooses this fake route, malicious nodes have the option of delivering the packets or dropping them. It is difficult to detect wormhole attacks because malicious nodes impersonate legitimate nodes. Previous algorithms detecting a wormhole require special hardware or tight time synchronization. In this paper, we develop an effective method called Wormhole Attack Prevention (WAP) without using specialized hardware. The WAP not only detects the fake route but also adopts preventive measures against action wormhole nodes from reappearing during the route discovery phase. Simulation results show that wormholes can be detected and isolated within the route discovery phase.
Prototype Generation from Ontology Charts
Authors: George Tsaramirsis, Iman Poernomo
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Semantic Analysis is a business analysis method designed to capture user requirements and represent them as text or in a graph that is called Ontology Chart. Ontology Charts can be mapped one to one to temporal Database schemas and Class diagrams that developers can use to produce software systems. In principle, these systems can be extended with out the need to modify the database schema of the legacy system. However Semantic Analysis is not widely used hence there is a lack of experts in the field and no design patterns are available. These make it difficult for the analysts to pass the organizational knowledge to the engineers. This study will suggest an automated technique that can produce a prototype from an Ontology Chart.
An xml index advisor for DB2
Authors: Iman Elghandour, Ashraf Aboulnaga, Daniel C. Zilio, Fei Chiang, Andrey Balmin, Kevin Beyer, Calisto Zuzarte
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved for these systems is how to choose the best set of indexes for a given workload. We have developed an XML Index Advisor that solves this XML index recommendation problem and is tightly coupled with the query optimizer of the database system. We have implemented our XML Index Advisor for DB2. In this demonstration we showcase the new query optimizer modes that we added to DB2, the index recommendation process, and the effectiveness of the recommended indexes.
Mobile web browsing: usability study
Authors: Sujan Shrestha
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)

The mobile phones are increasingly used to access different kind of information other than just to make voice calls. However, browsing large web pages which is not adapted for small-screen viewing is still very inconvenient. Web browsers are emerging which try to solve the interaction problems that occur when small-screen devices are used to access web pages designed for large screen viewing. This paper presents the results of the usability study in which users' mobile web browsing experience was evaluated in comparison to desktop Web browsing. The results indicate the users' performance was poor on mobile browser as users expected similar experience as on desktop; however for some users familiarity of web on desktop helped instead to navigate easily on mobile browser. The main problem participants had was difficulty of locating the content in long narrow page, which in turn caused extensive scrolling. This research suggests some improvement for mobile web browser and important consideration in designing mobile friendly websites that could help limit a lot of scrolling and increase the readability.
Feasible distributed CSP models for scheduling problems
Authors: Miguel A. Salido, Adriana Giret
Venue: Engineering Applications of Artificial Intelligence (2008)

A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distributed among multiple automated agents. Many researchers have developed techniques for solving DisCSPs. They assume for simplicity that each agent has exactly one variable. For real planning and scheduling problems, these techniques require a large number of messages passing among agents, so these problems are very difficult to solve. In this paper, we present a general distributed model for solving real-life scheduling problems. This distributed model is based on the idea of holonic systems. Furthermore, we propose some guidelines for distributing large-scale problems. Finally, we present two case studies in which two scheduling problems are distributed by using our model.
Trajectory sampling with unreliable reporting
Authors: Nick Duffield, Matthias Grossglauser
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

We define and evaluate methods to perform robust network monitoring using trajectory sampling in the presence of report loss. The first challenge is to reconstruct an unambiguous set of packet trajectories from the reports on sampled packets received at a collector. In this paper we extend the reporting paradigm of trajectory sampling to enable the elimination of ambiguous groups of reports, but without introducing bias into any characterization of traffic based on the surviving reports. Even after the elimination, a proportion of trajectories are incomplete due to report loss. A second challenge is to adapt measurement based applications (including network engineering, path tracing, and passive performance measurement) to incomplete trajectories. To achieve this, we propose a method to join multiple incomplete trajectories for inference, and analyze its performance. We also show how applications can distinguish between packet and report loss at the statistical level.
A High Performance Strategy for Constructing Dynamic MIB
Authors: XiaoTong Zhang, Lei Zhang, Jian Zhou
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

SNMP protocol is a simple network management protocol. As an important part of most network management software, its resource wastage and efficiency have important influence on the performance of the whole system. According to study, the main bottleneck of SNMP software is MIB objects’ storage and search. This paper proposes to use multi-path tree to keep the entire structure of MIB to eliminate the repeated storage of mutual identifiers by analyzing the structure of MIB tree. Compared to widely used Hash table, multi-path tree promotes the efficiency of resource usage. On the basis of that, this paper also proposes a high speed algorithm to search MIB objects by the combination of multi-path tree and AVL tree. The method above has been successfully applied to the Bidirectional HDTV Signal Transmitting System and it is proved to be efficient and reliable in actual network environment.
Selection of Regression Test Suite to Validate Software Applications upon Deployment of Upgrades
Authors: Anjaneyulu Pasala, Yannick L. H. Lew Yaw Fung, Fady Akladios, Appala Raju G. Ravi P. Gorthi
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

In this paper, we propose a regression test suite selection strategy that recommends a smaller test suite to validate software applications upon deployment of upgrades to application components. The selection strategy is based on analyzing the dynamic behavior of the application and recommends a smaller test suite to validate software applications. Methods based on dynamic analysis of software applications are more efficient as they analyze the application by executing the application according to its intended use. Based on the proposed approach, we have developed a prototype tool called InARTS that determines the impact of upgrades on industrial applications and suggests a reduced set of regression tests. Results of two case studies performed on two practical applications using InARTS are included.
Spelunking in La Cueva Grande
Authors: Laura Monroe
Venue: Proceedings of the 2008 workshop on Immersive projection technologies/Emerging display technologiges (2008)

La Cueva Grande is the 5-sided immersive facility put into place at Los Alamos National Laboratory. It was the highest-resolution stereo immersive facility in the world at the time of first use in 2005. The design and common use cases of LCG are presented, and lessons learned are discussed in retrospect.
Scheduling on Networks of Workstations with Task Runtime Restrictions
Authors: Marcin Bazyluk, Leszek Koszalka, Keith J. Burnham
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In recent time we spot a tendency to use the computing capacity of workstation clusters instead of investing in single machines with tremendous calculation power. Applying this idea we are able to execute multiple jobs paralelly. However, it still remains unclear how to schedule given jobs among available machines most effectively. Therefore this paper is an approach to optimization of mentioned scheduling. The problem faced here is known in the literature as parallel machine earliness-tardiness scheduling (PMSP E/T). The optimum criterion is finding the minimal sum of the weighted earliness and tardiness penalties. Due to NP-hardness of specified problem and thus difficulty in locating the optimum we propose two heuristic algorithms to find a satisfying solution: genetic with MCUOX crossover operator and tabu search. We have conducted a research to compare the effectiveness of both approaches and display their dependence on the size of examined instances. Results proove genetic approach superiority over tabu search for larger instances.
Applying naturalized interactions to mobile devices
Authors: Dhaval Joshi, Aman Sagar
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)

Mobile phones are increasingly becoming pervasive in India. Every month approximately 5 millions new users are added to the ever growing mobile population. However, in India, for a large group of people mobile phones are the first and only interactive digital media they directly operate and experience. A majority of these phones are based on an interaction paradigm that is directly adopted from the realm of computers. We believe, because of this there is huge gap between user's interaction with the real world and the interaction model of mobile phones. This gap gave us an opportunity to explore design alternatives that are more natural and real world like. In this paper we present a vision for Natural Interactions and their application on mobile phones as a Generative User Interface. We also discuss variables that affect mobile user experience through comparisons between real world and Mobile based digital interactions.
Foundational certified code in the Twelf metalogical framework
Authors: Karl Crary, Susmit Sarkar
Venue: ACM Transactions on Computational Logic (TOCL) (2008)

Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the systems' flexibility and extensibility. Using the Twelf metalogical framework, we have constructed a safety policy for the IA-32 architecture with a trusted runtime library. The safety policy is based on a formalized operational semantics. We have also developed a complete, foundational proof that a fully expressive typed assembly language satisfies that safety policy.
New Approach to Converged Networks
Authors: V. Skorpil
Venue: Proceedings of the Seventh International Conference on Networking (2008)

This paper describes a new approach to converged communication and computer networks. It was designed a new architecture of nodal active network element that is powerful enough and supports priority processing of different types of connection. It is exactly the missing support of priority processing that constitutes the greatest drawback of the majority of present-day active network elements. The proposed new architecture is based on the technology of artificial neural networks. Neural networks are used to optimize switching input requirements to outputs. This paper also describes design and computer simulations of a new architecture network element, based on artificial neural network technology with the support of priority processing for different connection types. As an example of a network element was selected switching area. This network element with optimized switching area is able to transfer large data quantity with minimum delay. Architecture of network element, that contains artificial neural network for optimized priority switching is described in this paper. It describes implementation of neural network in control process for data units switching. The programming language MATLAB 7.0 was used for software simulation. Network elements with new architecture, which uses a neural network, as well as intimated simulation, are suitable for working for example in personal wireless network communication systems.
Finding the differential characteristics of block ciphers with neural networks
Authors: Abbas Ghaemi Bafghi, Reza Safabakhsh, Babak Sadeghiyan
Venue: Information Sciences: an International Journal (2008)

We have developed a model to represent the differential operation of block ciphers in order to help finding differential characteristics. Through this model, the whole space of differential characteristics for a block cipher is represented by a multi-level weighted directed graph. In this way, the problem of finding the best differential characteristic for a block cipher reduces to the problem of finding the minimum-weight multi-branch path between two known nodes in the proposed graph. In this paper, we use recurrent neural networks to find such a path in the differential operation graph of a block cipher. The path is found through minimization of the network cost function. We use the Hopfield network and the Boltzmann machine with and without chaos to minimize the cost function. Chaos is introduced to assist the network to escape from the local minima of the cost function. Experimental results indicate the usefulness of the approach and comparison of the performance of the used techniques shows that the Boltzmann machine algorithm incorporating simulated annealing produces the best result.
Assertion-based verification of a 32 thread SPARC&trade; CMT microprocessor
Authors: Babu Turumella, Mukesh Sharma
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Exhaustive property checking, design defect isolation and functional coverage measurement are some of the key challenges of design verification. This paper describes how an assertion based approach successfully addressed these challenges for the verification of an enterprise class chip-multi-threaded (CMT) SPARC&trade; microprocessor. Methodology and experiences are discussed and recommendations are made on how to incorporate this into the design verification process. Experience with using assertion checks for formal verification as well as simulation based verification is presented, which is part of over 100 person year design verification effort.
FLARe: a Fault-tolerant Lightweight Adaptive Real-time middleware for distributed real-time and embedded systems
Authors: Jaiganesh Balasubramanian
Venue: Proceedings of the 4th on Middleware doctoral symposium (2007)

An important class of distributed real-time and embedded (DRE) applications consists of periodic soft real-time tasks. Timeliness and availability are essential requirements for the correct operation of these applications. Conventional solutions to these challenges tend to use non-adaptive and load-agnostic fault tolerance solutions within a real-time system, which often end up making ad hoc fault tolerance (e.g., failover targets) decisions that can further overload already strained resources. Potential adverse consequences of these ad hoc actions include excessive delays for real-time tasks and cascades of resource failures. This paper presents FLARe, which is a middleware that provides adaptive fault tolerance for DRE systems. FLARe's resource management infrastructure monitors various system metrics, including CPU utilization, and makes informed, load-aware, and adaptive decisions about the application's fault tolerance configurations (e.g., failover targets, physical placement of replicas). FLARe also employs decision making algorithms to adapt these decisions at runtime as faults occur and provides trade-offs between timeliness, availability, and performance as resources get overloaded, removed, or added.
Cardinality Estimation for Large-scale RFID Systems
Authors: Chen Qian, Hoilun Ngan, Yunhao Liu
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Counting or estimating the number of tags is crucial for large-scale RFID systems. The use of multiple readers was recently proposed to improve the efficiency and effectiveness in reading RFID tags. Due to the long processing time, tag identification based counting schemes are often impractical, especially when tags are attached to moving objects. The existing estimation based schemes, on the other hand, suffer from the multiple-reading problem. To address this issue, we propose the Lottery Frame (LoF) scheme, a replicate-insensitive estimation protocol, that is able to eliminate multiple-readings. We show the high accuracy, short processing time and low overhead of the proposed LoF scheme through analysis and simulations.
Designing a model for the development of strategic information systems in Indian public sector undertakings
Authors: Bikram Jit Rishi, D. P. Goyal
Venue: International Journal of Business Information Systems (2008)

The strategic value of information systems and the impact of information technology on businesses have increased the need for effective Strategic Information Systems (SIS) development. But the available methodologies for the development of SIS stress different issues, hence there is no clear guidance available for SIS development. Further review of literature indicates that in the case of developed and developing countries, a gap exists in the application of an integrated model for the development of SIS. Thus this study proposes a model and tests the model by collecting data from 164 managers who worked in Indian public sector undertakings. The results show that for the different constructs of the model, there are different factors, which must be considered by the organisations while developing SIS.
A Fuzzy Particle Swarm Approach to Multiobjective Quadratic Assignment Problems
Authors: Mingyan Zhao, Ajith Abraham, Crina Grosan, Hongbo Liu
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possible to simply weight the importance of each flow for the mQAP, it is best to use Pareto optimization to obtain the Pareto front or an approximation of it. Although Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems, research on mQAP has not much been investigated. This paper introduces a fuzzy particle swarm algorithm to handle the Multiobjective Quadratic Assignment Problem (mQAP). In the fuzzy scheme, the representations of the position and velocity of the particles in the conventional PSO is extended from the real vectors to fuzzy matrices. A new mapping is introduced between the particles in the swarm and the problem space in an efficient way. We evaluated the performance of the proposed approach. Empirical results illustrate that the approach can be applied for solving mQAP's very effectively.