ppxscal/embedding_network huggingface dataset:
A new model of projectile ballistic acceleration process based on closed vessel experimental data
Authors: Adrian Rotariu, Marius Valeriu Cîrmaci, Vasile Nutu, Lucian Istode, Tiganescu Viorel
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

A new model for projectile ballistic acceleration process is proposed. The work behind the model explores the possibility to use in a nontraditional way the characteristic diagrams obtained in closed-vessel tests for interior ballistics study. The new approach consists in an algorithm based on multi-dimensional interpolation of tests diagrams obtained from closed-bomb tests with similar heat loses as in gun barrel. The method shows promise and useful results could be obtained after building a signal database representing pressure versus time measurements in closed vessels with different volumes.
Understanding the new Information risks: The Requirement for a New Information Security Conceptual Framework
Authors: Robert Garigue
Venue: The EDP Audit, Control, and Security Newsletter (2007)

If one were to ask CIOs about their corporate technology structure, their response would focus on apparent concerns derived from the management of numerous types of servers, network bandwidth, operating system currency, contract lifecycles, personnel cost run rates, the numbers of projects, investments envelopes, and so forth. Managing these issues might create a sense of well-being, that all is under control. However, if you asked questions relating to information structure, the response would be less detailed, and much less specific.
Combining methods to evaluate mobile usability
Authors: Elisabeth Lesemann, Natalie Woletz, Sven Koerber
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

In this paper, we will discuss the deployment of quantitative and qualitative methods with focus on our special situation as being an external usability consultancy. We will report on two case studies in which we used different approaches to collect quantitative data from a large sample as well as qualitative data from a smaller sub-sample. In a simplified way, user tests in study 1 consisted of two phases, a first to collect quantitative data and a second to collect qualitative data. In study 2, quantitative and qualitative data were collected alternately. Qualitative data collection was skipped by a sub-sample in both studies. We will discuss methodological weaknesses of combined designs and how they can nevertheless be used to yield good results at a reasonable cost in a short amount of time. From our experience, we conclude that the approach used in study 1 proved to be more efficient concerning time and costs. From a methodological viewpoint, we will argue that the approach used in study 1 yielded satisfactory results for quantitative as well as qualitative measurements.
Integrating aspects in software architectures: PRISMA applied to robotic tele-operated systems
Authors: Jennifer Pérez, Nour Ali, Jose A. Carsı, Isidro Ramos, Bárbara Álvarez, Pedro Sanchez, Juan A. Pastor
Venue: Information and Software Technology (2008)

Aspect-Oriented Software Development (AOSD) has emerged as a new approach to develop software systems by improving their structure, reuse, maintenance and evolution properties. It is being applied to all stages of the software life cycle. In this paper, we present the PRISMA approach, which introduces AOSD in software architectures. PRISMA is characterized by integrating aspects as first-order citizens of software architectures. This paper shows how the PRISMA methodology is applied to develop a case study of the tele-operation system domain. We illustrate how the PRISMA approach can improve the development and maintenance processes of these kinds of industrial systems.
Numerical approximation of a one-dimensional space fractional advection-dispersion equation with boundary layer
Authors: John Paul Roop
Venue: Computers Mathematics with Applications (2008)

Finite element computations for singularly perturbed convection-diffusion equations have long been an attractive theme for numerical analysis. In this article, we consider the singularly perturbed fractional advection-dispersion equation (FADE) with boundary layer behavior. We derive a theoretical estimate which shows that the under-resolved case corresponds to @e
Query biased snippet generation in XML search
Authors: Yu Huang, Ziyang Liu, Yi Chen
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Snippets are used by almost every text search engine to complement ranking scheme in order to effectively handle user searches, which are inherently ambiguous and whose relevance semantics are difficult to assess. Despite the fact that XML is a standard representation format of web data, research on generating result snippets for XML search remains untouched. In this paper we present a system, eXtract, which addresses this important yet open problem. We identify that a good XML result snippet should be a self-contained meaningful information unit of a small size that effectively summarizes this query result and differentiates it from others, according to which users can quickly assess the relevance of the query result. We have designed and implemented a novel algorithm to satisfy these requirements and verified its efficiency and effectiveness through experiments.
Edge-disjoint Hamiltonian cycles in hypertournaments
Authors: Vojislav Petrovic, Carsten Thomassen
Venue: Journal of Graph Theory (2006)

We introduce a method for reducing k-tournament problems, for k&thinsp;&ge;&thinsp;3, to ordinary tournaments, that is, 2-tournaments. It is applied to show that a k-tournament on n&thinsp;&ge;&thinsp;k&thinsp;+&thinsp;1&thinsp;+&thinsp;24d vertices (when k&thinsp;&ge;&thinsp;4) or on n&thinsp;&ge;&thinsp;30d&thinsp;+&thinsp;2 vertices (when k&thinsp;=&thinsp;3) has d edge-disjoint Hamiltonian cycles if and only if it is d-edge-connected. Ironically, this is proved by ordinary tournament arguments although it only holds for k&thinsp;&ge;&thinsp;3. We also characterizatize the pancyclic k-tournaments, a problem posed by Gutin and Yeo.(Our characterization is slightly incomplete in that we prove it only for n large compared to k.). &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
Moving beyond security tracks: integrating security in cs0 and cs1
Authors: Blair Taylor, Shiva Azadegan
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

In response to the national computer security crisis, colleges and universities have developed security tracks and specialized security courses. While security tracks are effective at producing security experts, they only reach a small subset of students and occur after students have established a foundation of coding techniques. Most undergraduate computing students learn programming and design with little regard to security issues. To complement our security track and reach all computing students at the beginning of their studies, we piloted security integration across sections of CS0 and CS1, using a series of security laboratory modules. Preliminary results show increased security knowledge in the security-targeted sections. This paper describes the details and results of this pilot, which serves as a model for further integration throughout the CS curriculum.
Adaptive path scheduling for mobile element to prolong the lifetime of wireless sensor networks
Authors: Dakai Zhu, Ali Saman Tosun
Venue: ACM SIGBED Review (2008)

Mobile elements, which can traverse the deployment area and convey the observed data from static sensor nodes to a base station, has been introduced for energy efficient data collection in wireless sensor networks (WSNs). However, most existing solutions only calculate a single path for the mobile element, which may lead to quick energy depletion for sensor nodes that are far away from the path. In this paper, for real-time data collection in a WSN with one mobile element, we study the adaptive path scheduling problem for prolonging the lifetime of the WSN. Here, multiple paths are planned and the mobile element follows the paths in turn to balance the energy consumption on individual sensor nodes, thus to extend the WSN's lifetime. We first illustrate the problem with one motivational example. Then, for cases where the movement of the mobile element is restricted (e.g., straight lines), we propose and analyze the optimal solutions. For the general cases, we discuss the issues involved and speculate our future research directions.
Parallel finite element computations of three-dimensional flow problems using padfem2
Authors: Stephan Blazy, Oliver Marquardt
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

In this paper, numerical results of different flow problems for the three-dimensional incompressible Navier-Stokes equations are presented. The problems describe a flow around an obstacle as well as a flow through a system of pipes. Furthermore, chemical species are added in case of the pipe flow. This additionally comprises a transport problem for the introduced species. The numerical approximation is accomplished with a finite element characteristic projection method based on the schemes of Chorin and Vankan. The numerical method for solving the three-dimensional Navier-Stokes equations and the species equations using the parallel adaptive finite element framework padfem2 are illustrated. Mean values like lift and drag coefficient, pressure decay and species distribution are presented and compared with existing reference values. Finally, some efficiency results of the used solvers are given.
The Chinese text categorization system with association rule and category priority
Authors: Ding-An Chiang, Huan-Chao Keh, Hui-Hua Huang, Derming Chyr
Venue: Expert Systems with Applications: An International Journal (2008)

The process of text categorization involves some understanding of the content of the documents and/or some previous knowledge of the categories. For the content of the documents, we use the filtering measure for feature selection in our Chinese text categorization system. We modify the formula of TFIDF to strengthen important keywords' weights and weaken unimportant keywords' weights. For the knowledge of the categories, we use association rules to improve the precision of text classification and use category priority to represent the relationship between two different categories. Consequently, the experimental results show that our method can effectively not only decrease noise text but also increase the ratio of precision and recall of text categorization.
Removing the need for state dissemination in grid resource brokering
Authors: Peer Hasselmeyer
Venue: Proceedings of the 5th international workshop on Middleware for grid computing: held at the ACM/IFIP/USENIX 8th International Middleware Conference (2007)

Resource brokering in Grids is nowadays handled by resource brokers that require detailed knowledge of the state of the resources that they broker. In business settings, surrendering internal information on resources to an outside party is not an option. The traditional resource brokering method based on intimate resource knowledge is therefore not a viable possibility. This paper argues that the publication of resource state data is not needed for resource brokering. Instead, we advocate the use of service level agreements (SLAs). The use of SLAs for brokering lets providers keep state information internal and at the same time provides customers with guarantees on the used services. The proposed model has been implemented in the form of a resource broker that is based on Web Service technology. It shows that the approach of using SLAs for scheduling is a possible solution to keeping resource state private.
Joint Communication and Computation Task Scheduling in Grids
Authors: Konstantinos Christodoulopoulos, Nikolaos Doulamis, Emmanouel (Manos) Varvarigos
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm selects the computation resource to execute the task, determines the path to route the input data, and finds the starting times for the data transmission and the task execution, performing advance reservations. We initially present an optimal scheme of non-polynomial complexity and by appropriately pruning the set of candidate paths we also give a heuristic algorithm of polynomial complexity. We evaluate the performance of our algorithm and compare it to that of algorithms that handle only the computation or communication part of the problem separately. We show that in a Grid network where the tasks are CPU- and data-intensive important performance benefits can be obtained by jointly optimizing the use of the communication and computation resources.
A simple characterization of weighted Sobolev spaces with bounded multiplication operator
Authors: Jose M. Rodriguez
Venue: Journal of Approximation Theory (2008)

In this paper we give a simple characterization of weighted Sobolev spaces (with piecewise monotone weights) such that the multiplication operator is bounded: it is bounded if and only if the support of @m"0 is large enough. We also prove some basic properties of the appropriate weighted Sobolev spaces. To have bounded multiplication operator has important consequences in Approximation Theory: it implies the uniform bound of the zeros of the corresponding Sobolev orthogonal polynomials, and this fact allows to obtain the asymptotic behavior of Sobolev orthogonal polynomials.
Transforming smoothers for PDE constrained optimization problems
Authors: Volker Schulz, Gabriel Wittum
Venue: Computing and Visualization in Science (2008)

Transforming smoothers are known as a successful approach to the multigrid treatment of saddlepoint problems resulting from variational problems. In this paper we analyze similar multigrid methods in the context of the practically important class of optimization problems with partial differential equation constraint, which lead to a different kind of saddle point problems. We prove level independent convergence properties for the resulting multigrid methods and demonstrate this also in numerical investigations for a relevant model problem.
Relationship between versal deformations under different equivalence relations in the space of singular systems
Authors: M. I. García-Planas, M. D. Magret, S. Tarragona
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

In the space of singular time invariant linear systems Ex = Ax + Bu we relate miniversal deformations of triples of matrices M= {(E,A,B)}, E, A ∈ Mn(C) and B ∈ Mm×n(C) representing the systems, under usual two equivalence relations. Both equivalence relations can be defined by the action of a Lie groups G1 = {(P,R,U,V)} and G2 = {(P,Q,R,U,V)}, P, Q ∈ Gl(n;C), R ∈ Gl(m;C), U, V ∈ Mm×n(C), acting on M. α1: G1 × M → M ((P,R,U,V), (E,A,B)) → (P-1EP + P-1BU, P-1AP + P-1BV, P-1BR) α2: G2 × M → M ((P,Q,R,U,V), (E,A,B)) → (QEP + QBU, QAP + QBV, QBR). The key to relate them is see α2 as the action of α1 over the orbit space S/G0, G0 = Gl(n;C), under the action α0: G0 × S → S (G, (E,A,B)) → (GE,GA,GB). where S ⊂ M is the space of standardizable systems.
Improved TCAM-Based Pre-Filtering for Network Intrusion Detection Systems
Authors: Yeim-Kuan Chang, Ming-Li Tsai, Cheng-Chien Su
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

With the increasing growth of the Internet, the explosion of attacks and viruses significantly affects the network security. Network Intrusion Detection System (NIDS) is developed to identify these network attacks by a set of rules. However, searching for multiple patterns is a computationally expensive task in NIDS. Traditional software-based solutions can not meet the high bandwidth demanded in current high-speed networks. In the past, the pre-filtering designed for NIDS is an effective technique that can reduce the processing overhead significantly. A FNP-like TCAM searching engine (FTSE) [5][6] is an example that uses an 2-stage architecture to detect whether an incoming string contains patterns. In this paper, we propose two techniques to improve the performance of FTSE that utilizes ternary content addressable memory (TCAM) as pre-filter to achieve gigabit performance. The first technique performs the w-byte suffix pattern match instead of using w-byte prefix. The second technique finds the matching results from all groups rather than first group. We finally present the simulation result using Snort pattern set and DEFCON packet traces.
An On-Demand Test Triggering Mechanism for NoC-Based Safety-Critical Systems
Authors: Jason D. Lee, Nikhil Gupta, Praveen S. Bhojwani, Rabi N. Mahapatra
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

As embedded and safety-critical applications begin to employ many-core SoCs using sophisticated on-chip networks, ensuring system quality and reliability becomes increasingly complex. Infrastructure IP has been proposed to assist system designers in meeting these requirements by providing various services such as testing and error detection, among others. One such service provided by infrastructure IP is concurrent online testing (COLT) of SoCs. COLT allows system components to be tested in-field and during normal operation of the SoC. However, COLT must be used judiciously in order to minimize excessive test costs and application intrusion. In this paper, we propose and explore the use of an Anomaly-based Test Triggering Unit (ATTU) for on-demand concurrent testing of SoCs. On-demand concurrent testing is a novel solution to satisfy the conflicting design constraints of fault-tolerance and performance. Ultimately, this ensures the necessary level of design quality for safety-critical applications. To validate this approach, we explore the behavior of the ATTU using a NoC-based SoC simulator. The test triggering unit is shown to trigger tests from test infrastructure IP within 1ms of an error occurring in the system while detecting 81% of errors, on average. Additionally, the ATTU was synthesized to determine area and power overhead.
Visualization based policy analysis: case study in SELinux
Authors: Wenjuan Xu, Mohamed Shehab, Gail-Joon Ahn
Venue: Proceedings of the 13th ACM symposium on Access control models and technologies (2008)

Determining whether a given policy meets a site's high-level security goals can be difficult, due to the low-level nature and complexity of the policy language, and the multiple policy violation patterns. In this paper, we propose a visualization-based policy analysis framework that enables system administrators to visually query and visualize SELinux security policies and to easily identify the policy violations. We propose and formalize both a semantic substrate and adjacency matrix visualization techniques for policy visualization. Furthermore, we propose a visual query language for expressing policy queries in a visual form. Our framework is targeted towards enabling the average administrator by providing an intuitive cognitive sense about the policy, policy queries and policy violations. We also describe our implementation of a visualization-based policy analysis tool that provides the functionalities discussed in our framework.
Low complexity track initialization from a small set of non-invertible measurements
Authors: Christian R. Berger, Martina Daun, Wolfgang Koch
Venue: EURASIP Journal on Advances in Signal Processing (2008)

Target tracking from non-invertible measurement sets, for example, incomplete spherical coordinates measured by asynchronous sensors in a sensor network, is a task of data fusion present in a lot of applications. Difficulties in tracking using extended Kalman filters lead to unstable behavior, mainly caused by poor initialization. Instead of using high complexity numerical batch-estimators, we offer an analytical approach to initialize the filter from a minimum number of observations. This directly pertains to multihypothesis tracking (MHT), where in the presence of clutter and/or multiple targets (i) low complexity algorithms are desirable and (ii) using a small set of measurements avoids the combinatorial explosion. Our approach uses no numerical optimization, simply evaluating several equations to find the state estimates. This is possible since we avoid an over-determined setup by initializing only from the minimum necessary subset of measurements. Loss in accuracy is minimized by choosing the best subset using an optimality criterion and incorporating the leftover measurements afterwards. Additionally, we provide the possibility to estimate only sub-sets of parameters, and to reliably model the resulting added uncertainties by the covariance matrix. We compare two different implementations, differing in the approximation of the posterior: linearizing the measurement equation as in the extended Kalman filter (EKF) or employing the unscented transform (UT). The approach will be studied in two practical examples: 3D track initialization using bearingsonly measurements or using slant-range and azimuth only.
Goal models as architectural knowledge
Authors: Axel van Lamsweerde
Venue: Proceedings of the 3rd international workshop on Sharing and reusing architectural knowledge (2008)

Goal models are developed in the intertwined phases of requirements engineering and early architectural design. They relate the goals of a software-intensive system, the agents forming the software and its environment, and the objects and tasks such agents control in order to operationalize the goals. We briefly discuss why and how goal models provide a key asset for documenting the contextual and derivational aspects of a software architecture.
Efficient signature based malware detection on mobile devices
Authors: Deepak Venugopal, Guoning Hu
Venue: Mobile Information Systems (2008)

The threat of malware on mobile devices is gaining attention recently. It is important to provide security solutions to these devices before these threats cause widespread damage. However, mobile devices have severe resource constraints in terms of memory and power. Hence, even though there are well developed techniques for malware detection on the PC domain, it requires considerable effort to adapt these techniques for mobile devices. In this paper, we outline the considerations for malware detection on mobile devices and propose a signature based malware detection method. Specifically, we detail a signature matching algorithm that is well suited for use in mobile device scanning due to its low memory requirements. Additionally, the matching algorithm is shown to have high scanning speed which makes it unobtrusive to users. Our evaluation and comparison study with the well known Clam-AV scanner shows that our solution consumes less than 50% of the memory used by Clam-AV while maintaining a fast scanning rate.