ppxscal/embedding_network huggingface dataset:
Design of the Next Generation Military Network Management System Based on NETCONF
Authors: Zhu Wei, Liu Ningning, Shan Weifeng, Fu Guobin
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper presents the requirement of the military network management on the next generation network environment, and suggests a NETCONF-based application program interface (API) technology for military network, and it also discusses the architecture and technology of the API. Based on this discussion, it gives a military network management system model for the next generation network and evaluated its effectiveness. The result presents that this system improves the ability of the network configuration automatization, at the same time, it remarkably reduces the workload of network management.
The Utilization of User Sessions in Testing
Authors: Izzat Alsmadi
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Software testing cost is rising with the complexity of modern applications’ user interfaces, frameworks, and technologies. However, testing stays an import software engineering stage that insures the quality of the developed software and eventually reduces the overall cost. This paper proposed utilizing user sessions for test case generation and execution. User sessions can be gathered from the application in production environments and represent user stories or scenarios. Rather than rerunning user sessions for test automation, as in record/replay tools, this research takes the track of abstracting requirements from those sessions to make them independent of the scripting language or the tool that created them. The suggested approach abstracts user sessions to make them more independent and reusable. This approach is expected to improve the utilization of user sessions from being copied and reused in the same original format, which makes it complex to edit and inflexible, to a format that can be used and utilized in different applications and platforms.
Consistent digital rays
Authors: Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

Given a fixed origin o in the d-dimensional grid, we give a novel definition of digital rays dig(op) from o to each grid point p. Each digital ray dig(op) approximates the Euclidean line segment op between o and p. The set of all digital rays satisfies a set of axioms analogous to the Euclidean axioms. We measure the approximation quality by the maximum Hausdorff distance between a digital ray and its Euclidean counterpart and establish an asymptotically tight Θ(log n) bound in the n x n grid. The proof of the bound is based on discrepancy theory and a simple construction algorithm. Without a monotonicity property for digital rays the bound is improved to O(1). Digital rays enable us to define the family of digital star-shaped regions centered at o which we use to design efficient algorithms for image processing problems.
Approximation of Cauchy problems for elliptic equations using the method of lines
Authors: Mathias Charton, Hans-Jürgen Reinhardt
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

In this contribution we deal with the development, theoretical examination and numerical examples of a method of lines approximation for the Cauchy problem for elliptic partial differential equations. We restrict ourselves to the Laplace equation. A more general elliptic equation containing a diffusion coefficient will be considered in a forthcoming paper. Our main results are the regularization of the illposed Cauchy problem and the proof of error estimates leading to convergence results for the method of lines. These results are based on the conditional stability of the continuous Cauchy problem and an approximation by appropriately chosen finite-dimensional spaces, onto which the possibly perturbed Cauchy data are projected. At the end of this paper we present and discuss results of some of our numerical computations. There are multiple applications in material sciences, thermodynamics, medicine etc.; related problems are shape optimization problems which are important for nondestructive testing, e.g. for crack location, thermal tomography and other applications.
Preserving time in large-scale communication traces
Authors: Prasun Ratn, Frank Mueller, Bronis R. de Supinski, Martin Schulz
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

Analyzing the performance of large-scale scientific applications is becoming increasingly difficult due to the sheer size of performance data gathered. Recent work on scalable communication tracing applies online interprocess compression to address this problem. Yet, analysis of communication traces requires knowledge about time progression that cannot trivially be encoded in a scalable manner during compression. We develop scalable time stamp encoding schemes for communication traces. At the same time, our work contributes novel insights into the scalable representation of time stamped data. We show that our representations capture sufficient information to enable what-if explorations of architectural variations and analysis for path-based timing irregularities while not requiring excessive disk space. We evaluate the ability of several time-stamped compressed MPI trace approaches to enable accurate timed replay of communication events. Our lossless traces are orders of magnitude smaller, if not near constant size, regardless of the number of nodes while preserving timing information suitable for application tuning or assessing requirements of future procurements. Our results prove time-preserving tracing without loss of communication information can scale in the number of nodes and time steps, which is a result without precedent.
Finding effective points by surrogate models with overcomplete bases
Authors: Weichung Wang, Ray-Bing Chen
Venue: Journal of Computational and Applied Mathematics (2008)

We develop algorithms to find the so-called effective points (EPs) x@?X@?R^n such that the corresponding responses f(x)@?R belong to a specific region of interest (ROI). Examples of an ROI include extreme values, bounded intervals, and positivity. We are especially interested in the problem defined by the following characteristics: (i) the definition of f(x) is either complicated or implicit, (ii) the response surface f(X) does not fit simple patterns, and (iii) computational costs of function evaluations is high. To solve this problem, we iteratively approximate the true yet unknown response surface with simplified surrogate models and then use the surrogate models to predict the possible EPs. Unlike interpolation schemes, the surrogate models are formed by linear combinations of a set of overcomplete bases and they are not obliged to fit the known response value. A numerical example that involves finding positive Lyapunov exponents of a dynamical system shows that the algorithm is efficient and practical.
TUBE: Automated Protocol-Level Middleware Interoperation
Authors: Richard Slamkovic, George Fernandez, Jim McGovern
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Following changes in business processes and technology enterprises often need to interoperate protocols of heterogeneous middleware. This paper presents an automated, data-driven approach to protocol-level middleware interoperation, based on declarative descriptions of these protocols. The run-time engine of TUBE (The Ubiquitous Broker Environment), provides a layer between application-level components and middleware that allows a degree of independence from particular middleware implementations by taking protocol descriptions and performing the necessary translations. The TUBE framework is designed to try alternatives if the searched protocol is unavailable, making it easy to deploy different types of middleware and special protocol extensions. TUBE has been implemented and successfully tested across a range of commonly used middleware, including synchronous, asynchronous, object-based, binary and text-based protocols. Key components of the system are currently in operation in a large Australian corporation.
Recent Progress of ILO-Based Novel Synchronization Techniques for Transceivers Used in Broadband Wireless Communication Systems
Authors: Munir Ahmad Tarar, Zhizhang (David) Chen
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

To deliver data at hundreds of megabits per sec over wireless media with high accuracy requires high signal acquisition and synchronization speeds. Many techniques have been developed in the past and choice of a right synchronization technique has become user and application specific. In this paper, we present our recent progress on the development of synchronization techniques, first, by reviewing the present techniques and then by presenting our work on using injection-locked techniques. Our work include the second-harmonic injection-locked phase-locked loop (SH-ILPLL) for BPSK signal demodulation with wide locking range, a single-frequency ILO for high speed 160Msps QPSK detection and a selectable frequency dielectric resonator oscillator (SF-DR-ILO) based synchronization for coherent demodulation of multi-frequency QPSK signals of up to 63Msps. Our novel synchronization techniques can be used for modern communication systems such as WiMax or UWB applications. They can also be used for a fixed frequency or multiple-frequency high data rate video transmission over the indoor reciprocal channel.
Mixed-norm constant modulus algorithm for channel equalization of wireless communication systems
Authors: Jusak Jusak, Zahir M. Hussain
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Constant Modulus algorithm (CMA) has been widely used for blind channel equalization. The slow convergence speed of CMA has motivated us to propose a new method of updating filter coefficients based upon a mixing of Constant Modulus 2-2 (CM 2-2) and Constant Modulus 1-1 (CM 1-1) cost functions. It is shown that the proposed algorithm satisfies the Benveniste-Goursat-Ruget Theorem. Hence, under perfect blind equalization conditions, it guarantees that searching by the stochastic gradient descent method will lead to its minimum point. The performance of the algorithm is demonstrated in channel equalization of wireless communication systems.
Analysis of the time-optimal system design algorithm structure
Authors: Alexander Zemliak, Eduardo Rios
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

The formulation of the process of analog system design has been done on the basis of the control theory application as the problem of a special functional minimization. This approach generalizes the design process and produces the different design trajectories inside the same optimization procedure. Numerical examples show that the potential computer time gain of the optimal design strategy with respect to the traditional design strategy increases when the size and the complexity of the system increase. Some properties of an additional acceleration effect of the design process were analyzed. The special selection of the optimization process start point provides the acceleration effect with a great probability. The positions of the optimal switch points of the control vector were found on the basis of the analysis of the special Lyapunov function of the design process by means of the time derivative minimization. The combination of the acceleration effect with the start point preliminary selection and the optimal switch points of the control vector serve as the principal ideas to the time-optimal design algorithm construction.
On the complexity of bounded-interaction and noninteractive zero-knowledge proofs
Authors: J. Kilian
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We consider the basic cryptographic primitive known as zero-knowledge proofs on committed bits. In this primitive, a prover P commits to a set of bits, and then at a later time convinces a verifier V that some property /spl Pscr/ holds for a subset of these bits. It is known how to implement this primitive based on an ordinary bit-committal primitive, but the standard implementations involve a great deal of interaction between the prover and the verifier. We introduce new implementations that require markedly less interaction. We implement bounded-interaction proofs on committed bits, generalizing a model of A. De Micali et al. (1988). For all security parameters, our implementations require only a lg/sup 2/ (n) overhead over the best known circuit-based interactive implementations; for sufficiently large security parameters this gap drops to a lg(n) factor.
Active notes: context-sensitive notes for mobile devices
Authors: Suresh Chande, Panu Vartiainen, Kimmo Rämö
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)

Modern knowledge workers utilize digital computing platforms to create and consume digital media as part of their daily routines, using tools such as: Email, Messaging (SMS, IM), Audio podcasts, imaging, etc. As mobility is central in nature for mobile workers, the mobile computing platforms such as smart phones play an important role to consume and capture information into digital media. There are several available technology enablers in current mobile devices which help creation of Text, Audio, Video, Images and PIM application data, such as contacts, calendar events etc. These enablers are typically independent set of applications to help utilize different media types in different applications such as note taking tools. In this research we developed a research prototype of an application that helps user to make notes with a unified interface to create and maintain multimedia notes. We investigated particularly the act of note taking by mobile workers and the different usage patterns of notes in work environment covering both during and after they have been created. We studied different sets of users for their note taking practices. On identifying the key challenges posed by user interactions and the gaps posed in current solutions we devised and developed the Active Notes prototype. Active Notes an interactive and dynamic behavior provides to user created notes, responding to specific contextual events that occur in user communications. We will discuss our research approaches on how we identified the required features in our research prototype of Active Notes. We will elaborate the basis which supports the need for the rich functionality developed along with system level details on how we implemented this. We will discuss some of the features with the help of few application screen shorts to depict the effect of the features.
Decentralized managing of replication objects in massively distributed systems
Authors: Daniel Klan, Kai-Uwe Sattler, Katja Hose, Marcel Karnstedt
Venue: Proceedings of the 2008 international workshop on Data management in peer-to-peer systems (2008)

Data replication is a central technique to increase availability and performance of distributed systems. While offering many advantages it also requires more effort for ensuring data consistency in case of updates. In the research literature various approaches for replication management in distributed databases have been presented, but they are mostly limited either in scalability or in the consistency guarantees they provide. On the other hand, P2P systems usually provide replication support but ignore the update problem. In this paper we present a new approach for managing replicated data in wide area distributed networks. Our solution is orthogonal to the underlying infrastructure and managed in a decentralized manner. It guarantees single-master consistency and allows updates at any node of the system by combining traditional replication techniques with ideas known from P2P systems.
eValue and Value-driven User Responses to Information Technology
Authors: Elitsa Shumarova, Paul A. Swatman
Venue: Electronic Markets (2007)

This paper explores eValue creation, assessment and distribution within communities joined through the Web, and the possible implications on end-user acceptance of information technology (IT). We undertake to theorize more richly than has heretofore been done on the decision processing perspective of user acceptance of IT and, based on that, analyse different types of value-driven user motivations. Specifically, we draw on two metaphorical constructs-'attention economy' and 'high-tech gift economy'-in order to understand value-driven user responses to IT, and illustrate them through the example of Open Source Software (OSS) development teams. The focal point of interest is the adoption-diffusion continuum (from Prior Use to Post-adoptive Behaviour) within the context of end-user decision processing. A rough eValue anthology is introduced as a secondary epistemological level to aid clarifying when and how value-rational end-consumer action affects attitude toward use. The analysis is based on a unified view on user acceptance decision processing, combining the management perspective (Cooper and Zmud 1990), the user perspective (Rogers 1995), the organizational perspective (Swanson and Ramiller 2004), with emphasis on the decision processing perspective (Engel et al. 2001).
Managing Change from the Top: Using Fact-Based Enforcement to Support Change Management Policies
Authors: Dwayne Melançon
Venue: The EDP Audit, Control, and Security Newsletter (2007)

No doubt about it, change is an ever-present fact of life in the dynamic environment of an IT data center. But how change is managed, and how change management is enforced, can make the difference between how efficiently an IT organization handles security, system availability, costs, and efficiency-or, how it does not. Unfortunately, change can be an organization's worst enemy if not controlled. Unauthorized and undocumented change results in serious threats to operational stability, security, and compliance posture. But change, when managed clearly and consistently, can also accelerate an organization's performance-that is, if strong change management processes and policies are enforced.
Cross-lingual search over 22 european languages
Authors: Blaž Fortuna, Jan Rupnik, Boštjan Pajntar, Marko Grobelnik, Dunja Mladenič
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

In this paper we present a system for cross-lingual information retrieval, which can handle tens of languages and millions of documents. Functioning of the system is demonstrated on corpus of European Legislation (22 languages, more than 400,000 documents per language). The system uses an interactive web-interface, which can take advantage of a predefined thesaurus allowing the user to dynamically re-rank the retrieval results based on the mapping onto a predefined thesaurus.
Securing services in nomadic computing environments
Authors: Domenico Cotroneo, Cristiano di Flora, Almerindo Graziano, Stefano Russo
Venue: Information and Software Technology (2008)

This work addresses the existing research gap regarding the security of service oriented architectures and their integration in the context of nomadic computing. The state of the art of Service Oriented Architectures (SOAs) is thoroughly investigated to understand what secure service provision means for different SOAs and whether an established notion of secure SOA existed. Based on the analysis of existing SOAs, we define a set of requirements for securing services among different nomadic computing domains. Such requirements concern the security of service registration and that of the discovery and delivery phases. The surveyed SOAs are then evaluated in the light of the defined requirements, revealing interesting observations about how current SOAs address security issues. The second part of this work addresses the research issue of achieving secure service provision in a nomadic computing environment characterized by a number of heterogeneous service oriented architectures. A solution is presented in the form of an architectural model, named Secure Nomadic Computing Architecture. The model relies on a novel three-phase discovery-delivery protocol which allows the enforcement of a number of security requirements, identified as a result of the first part of the work. Finally, we present an exemplary implementation of the proposed architectural model developed within the context of a distributed management information system for the discovery of digital educational content.
Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling
Venue: Sketch Based Interfaces and Modeling (2007)

We are pleased to present the proceedings of the Fourth Eurographics Workshop on Sketch-Based Interfaces and Modeling (SBIM '07). This annual workshop explores techniques and technologies needed to enable sketchbased interfaces. This year's workshop took place in Riverside, California, on the University of California, Riverside campus from August 2-4, coinciding with the 2007 ACM SIGGRAPH conference in San Diego, California. The program included paper presentations, invited talks, a hands-on demo session, and a break-out brainstorming session. This year's 18 paper presentations addressed novel work in a wide-range of exciting areas in sketchbased interfaces and modeling including sketch recognition, ink processing, user interface design, and 3D modeling. In Thursday's keynote presentation, James Landay, Associate Professor at the University of Washington and Strategic Advisor at Intel Research, proposed activity-based pen computing as a new model for the design of pen-based interfaces. In Friday's invited talk, Andrew Forsberg, a Research Scientist at Brown University, discussed ways to strengthen the pen computing research community. In the hands-on demo session, participants had the opportunity to try out eight novel pen-based interfaces. On Saturday, members of Microsoft Corp. and the Brown University Center for Pen Based Computing led a hands-on technical development tutorial for the Tablet PC. Participants at the tutorial created a simple application to collect and manipulate ink, and learned the latest details of working with new APIs, such as the Real-Time Stylus and the Handwriting Recognition APIs. The workshop included presentations from Sashi Raghupathy, who leads the Microsoft ink development team, and Jay Pittman, who leads the Microsoft handwriting recognition team. The tutorial concluded with an opportunity for researchers to give the Microsoft tablet team feedback about what they would like to see in future versions of the Tablet PC platform software.