ppxscal/embedding_network huggingface dataset:
Optimized cutting plane algorithm for support vector machines
Authors: Vojtěch Franc, Soeren Sonnenburg
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We have developed a new Linear Support Vector Machine (SVM) training algorithm called OCAS. Its computational effort scales linearly with the sample size. In an extensive empirical evaluation OCAS significantly outperforms current state of the art SVM solvers, like SVMlight, SVMperf and BMRM, achieving speedups of over 1,000 on some datasets over SVMlight and 20 over SVMperf, while obtaining the same precise Support Vector solution. OCAS even in the early optimization steps shows often faster convergence than the so far in this domain prevailing approximative methods SGD and Pegasos. Effectively parallelizing OCAS we were able to train on a dataset of size 15 million examples (itself about 32GB in size) in just 671 seconds --- a competing string kernel SVM required 97,484 seconds to train on 10 million examples sub-sampled from this dataset.
Context analysis: toward pragmatics of web information systems design
Authors: Hui Ma, Klaus-Dieter Schewe, Bernhard Thalheim
Venue: Proceedings of the fifth on Asia-Pacific conference on conceptual modelling - Volume 79 (2008)

On a high level of abstraction a Web Information System (WIS) can be described by a storyboard, which in an abstract way specifies who will be using the system, in which way and for which goals. While syntax and semantics of storyboarding has been well explored, its pragmatics has not. This paper contributes context analysis as a step towards closing this gap. We classify various aspects of contexts related to actors, storyboard, system and time, which make up the context space, then analyse each of these aspects in detail. This is formally support by lifting relations. Finally, we analyse how contexts impact on life cases, user models and the storyboard.
Production-process modelling based on production-management data: a Petri-net approach
Authors: D. Gradisar, G. Music
Venue: International Journal of Computer Integrated Manufacturing (2007)

During the development of a production control system, an appropriate model of the production process is needed to evaluate the various control strategies. This paper describes how to apply timed Petri nets and existing production data to the modelling of production systems. Information concerning the structure of a production facility and the products that can be produced is usually given in production-data management systems. We describe a method for using these data to construct a Petri-net model algorithmically. The timed Petri-net simulator, which was constructed in Matlab, is also described. This simulator makes it possible to introduce heuristics, and, in this way, various production scenarios can be evaluated. To demonstrate the applicability of our approach, we applied it to a scheduling problem in the production of furniture fittings.
Parallel and distributed simulation of sediment dynamics in shallow water using particle decomposition approach
Authors: W. M. Charles, E. van den Berg, H. X. Lin, A. W. Heemink, M. Verlaan
Venue: Journal of Parallel and Distributed Computing (2008)

This paper describes the parallel simulation of sediment dynamics in shallow water. By using a Lagrangian model, the problem is transformed to one in which a large number of independent particles must be tracked. This results in a technique that can be parallelised with high efficiency. We have developed a sediment transport model using three different sediment suspension methods. The first method uses a modified mean for the Poisson distribution function to determine the expected number of the suspended particles in each particular grid cell of the domain over all available processors. The second method determines the number of particles to suspend with the aid of the Poisson distribution function only in those grid cells which are assigned to that processor. The third method is based on the technique of using a synchronised pseudo-random-number generator to generate identical numbers of suspended particles in all valid grid cells for each processor. Parallel simulation experiments are performed in order to investigate the efficiency of these three methods. Also the parallel performance of the implementations is analysed. We conclude that the second method is the best method on distributed computing systems (e.g., a Beowulf cluster), whereas the third maintains the best load distribution.
Extension of the DSMC method to high pressure flows
Authors: Evgeny V. Titov, Deborah A. Levin
Venue: International Journal of Computational Fluid Dynamics (2007)

A collision-limiter method, designated as equilibrium direct simulation Monte Carlo (eDSMC), is proposed to extend the DSMC technique to high pressure flows. The method is similar to collision-limiter schemes considered in the past with the important distinction that for inviscid flows, equilibrium is enforced in the entire flow by providing a sufficient number of collisions, based on pre-simulation testing. To test the method with standard DSMC and Navier-Stokes (NS) methods, axi-symmetric nozzle and embedded-channel flows are simulated and compared with experimental temperature data and pre-existing calculations, respectively. The method is shown to agree with third-order Eulerian nozzle flows and first-order channel flows. Chapman-Enskog theory is utilized to predict the range of initial conditions where eDSMC is potentially useful for modeling flows that contain viscous boundary layer regions. Comparison with supersonic nozzle data suggests that the eDSMC method is not adequate for capturing the large variation in flow length scales occurring in supersonic expansions into a vacuum. However, when eDSMC is used in combination with the baseline-DSMC method a near-exact solution is obtained with a considerable computational savings compared to the exact DSMC solution. Viscous flow channel calculations are found to agree well with an exact Navier-Stokes (NS) calculation for a small Knudsen number case as predicted by Chapman-Enskog theory.
Flexible Semantic-Based Service Matchmaking and Discovery
Authors: Devis Bianchini, Valeria Antonellis, Michele Melchiori
Venue: World Wide Web (2008)

Automated techniques and tools are required to effectively locate services that fulfill a given user request in a mobility context. To this purpose, the use of semantic descriptions of services has been widely motivated and recommended for automated service discovery under highly dynamic and context-dependent requirements. Our aim in this work is to propose an ontology-based hybrid approach where different kinds of matchmaking strategies are combined together to provide an adaptive, flexible and efficient service discovery environment. The approach, in particular, exploits the semantic knowledge about the business domain provided by a domain ontology underlying service descriptions, and the semantic organization of services in a service ontology, at different levels of abstraction.
Broadcasting with the Least Energy is an NP-Complete Problem
Authors: Wuu Yang, Huei-Ru Tseng, Rong-Hong Jan, Bor-Yeh Shen
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Energy conservation is an important issue in wireless networks. We propose a method for estimating the least amount of energy needed for broadcasting a message to all nodes in the network. The method can work with any reasonable energy models. We prove that this least-energy problem is NP-complete by showing that the maximum-leaf spanning-tree problem is a special case of the least-energy problem.
Grammar-driven generation of domain-specific language debuggers
Authors: Hui Wu, Jeff Gray, Marjan Mernik
Venue: Software&mdash;Practice Experience (2008)

Domain-specific languages (DSLs) assist a software developer (or end-user) in writing a program using idioms that are similar to the abstractions found in a specific problem domain. Tool support for DSLs is lacking when compared with the capabilities provided for standard general-purpose languages (GPLs), such as Java and C++. For example, support for debugging a program written in a DSL is often non-existent. The lack of a debugger at the proper abstraction level limits an end-user's ability to discover and locate faults in a DSL program. This paper describes a grammar-driven technique to build a debugging tool generation framework from existing DSL grammars. The DSL grammars are used to generate the hooks needed to interface with a supporting infrastructure constructed for an integrated development environment that assists in debugging a program written in a DSL. The contribution represents a coordinated approach to bring essential software tools (e.g. debuggers) to different types of DSLs (e.g. imperative, declarative, and hybrid). This approach hides from the end-users the accidental complexities associated with expanding the focus of a language environment to include debuggers. The research described in this paper addresses a long-term goal of empowering end-users with development tools for particular DSL problem domains at the proper level of abstraction without depending on a specific GPL. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Adaptive Visual Tracking Using Particle Filter
Authors: Shi-Wei Gao, Lei Guo, Liang Chen, Yong Yu
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The difficulty in visual tracking is how to estimate the object position quickly and reliably. Particle filter (PF) has proven successfully for nonlinear non-Gaussian estimate problems, but its degeneracy problem is very serious. For alleviating the degeneracy problem of the PF, the choice of proposal distribution plays an important role. Therefore in the context, the Galerkin's method is utilized to generate the proposal distribution of the PF. It not only overcomes the degeneracy problem of the common PF algorithm, but estimation precision is better. The article also proposes the integration of color cues and shape cues adaptively into the frame. Experimental results show the feasibility of the proposed algorithm in this paper.
Technical Section: Robust watermarking motion data with DL-STDM
Authors: Xiaomao Wu, Lizhuang Ma, Zhuoqun Dong, Lionel Revéret
Venue: Computers and Graphics (2008)

In this paper, we propose a robust watermarking scheme called Double-Layer Spread-Transform Dither Modulation (DL-STDM) for watermarking motion data. We embed watermarks into the DCT domain of the quaternion logarithm image (QLI) representation of motion data. Experimental results demonstrate that our scheme is more robust than existing motion watermarking schemes against a wide variety of attacks, including noise addition, smoothing, cropping, attenuation, simplification, time warping, non-uniform scaling along amplitude axis and 2nd watermarking. Our scheme is useful for copyright protection and ownership identification of motion data.
Blending realities in game space
Authors: Troy Innocent
Venue: Computers in Entertainment (CIE) (2008)

Modes of representation in digital games are explored in terms of game aesthetics, structure, and logic. A model for &ldquo;world-making&rdquo; is developed that identifies key components of digital media language and their relationship to shifting modes of representation. These ideas are demonstrated through three art works created by the Idea-ON>&excl;, Iconica, and Semiomorph. The final work, Semiomorph, combines the theory of &ldquo;semiotic morphism&rdquo; with gameplay to create a digital game that generates blended realities. This work is described and analyzed in detail to illustrate the proposed model.
Test generation for graphical user interfaces based on symbolic execution
Authors: Svetoslav R. Ganov, Chip Killmar, Sarfraz Khurshid, Dewayne E. Perry
Venue: Proceedings of the 3rd international workshop on Automation of software test (2008)

While Graphical User Interfaces (GUIs) have become ubiquitous, testing them remains largely ad-hoc. Since the state of a GUI is defined by a sequence of events on the GUI's widgets, a test input for a GUI is such an event sequence. Due to the combinatorial nature of the sequences, testing a GUI thoroughly is problematic and time-consuming. Moreover, the wide range of possible values for certain GUI widgets, such as a textbox, compounds the problem. This paper presents a novel test generation approach based on symbolic execution to obtain data inputs and enumerate event sequences that are likely to maximize code coverage of a GUI application. Key contributions are introducing the technique of symbolic execution in GUI testing (addressing a common weakness of traditional GUI testing frameworks) and performing symbolic execution over strings (in addition to primitives). Doing so minimizes the number of event sequences that form the resulting test suite. To determine feasibility of path conditions that arise in symbolic execution, we implement a solver for constraints over strings (in addition to primitives). We evaluate our test generation approach.
Traveling the Semantic Web through Space, Time, and Theme
Authors: Amit Sheth, Matthew Perry
Venue: IEEE Internet Computing (2008)

So far, Semantic Web researchers have focused most of their attention on the thematic dimension, but increasing amounts of spatial and temporal data are appearing on the Web. In this installment of Semantics and Services, the authors further develop the idea of spatial, temporal, and thematic processing of Semantic Web data and describe the Web infrastructure needed to support it.
What students say about gender in hiring software professionals
Authors: Donald Chinn, Tammy VanDeGrift
Venue: ACM SIGCSE Bulletin (2008)

We asked students to make hiring decisions for a program manager and a software engineer for a fictitious software company. In one population of students, a pool of four candidates was provided. In another population of students, the candidates differed from the first in that the descriptions of two of the candidates were represented by the opposite gender. This poster provides evidence to help answer the following research questions: 1) Does gender matter in the rate of selection among candidates? and 2) Does gender matter in how candidates are perceived? Through analyzing students' work, we show that gender plays a role: the female candidate is more popular and assumptions and perceptions about candidates vary with gender.
On connected line sets of antiflag class [0,α,q] in AG(n,q)
Authors: F. De Clerck, N. De Feyter
Venue: European Journal of Combinatorics (2008)

We investigate the partial linear spaces, fully embedded in an affine space AG(n,q) with the property that for every antiflag {p,L}, the number of lines through p intersecting L is either 0,@a, or q. Besides some general results we prove a complete classification of those geometries fully embedded in an affine plane of order q and of the connected geometries with 1
Catch Me (If You Can): Data Survival in Unattended Sensor Networks
Authors: Roberto Di Pietro, Luigi V. Mancini, Claudio Soriente, Angelo Spognardi, Gene Tsudik
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Unattended sensor networks operating in hostile environments might collect data that represents a high-value target for the adversary.The unattended sensor's inability to off-load -- in real time -- sensitive data to a safe external entity makes it easy for the adversary to mount a focused attack aimed at eliminating certain target data. In order to facilitate survival of this data, sensors can collectively attempt to confuse the adversary by changing its location and content, i.e., by periodically moving the data around the network and encrypting it.In this paper, we focus on data survival in unattended sensor networks faced with an adversary intent on surgically destroying data which it considers to be of high value. After motivating the problem and considering several attack flavors, we propose several simple techniques and provide their detailed evaluation.
A Systems Engineering Approach to Exception Handling
Authors: Herbert Hecht
Venue: Proceedings of the Third International Conference on Systems (2008)

Missing or faulty exception handling has caused a number of spectacular system failures and is a major cause of software failures in extensively tested critical systems. Prior work is reviewed and found lacking in a comprehensive approach at the system level as contrasted with details of exception handling at the programming level. As a path to better understanding of the problem, the needs for exception handling are described as they arise at different times of the development cycle and from different disciplines. It is seen that a comprehensive solution is difficult but is essential. The details of stating requirements for exception handling are addressed and a methodology for verifying the effectiveness and completeness is described. Further research needs are discussed and the formation of a working group for a best practice or standard on the subject is suggested.
Home Network Security
Authors: Hans Scholten, Hylke van Dijk
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Service discovery and secure and safe service usage are essential elements in the deployment of home and personal networks. Because no system administrator is present, setup and daily operation of such a network has to be automated as much as possible with a high degree of user friendliness. To achieve this goal many systems sacrifice security and privacy such, that services can be discovered and used unauthorized or a person's privacy may be breached. In this paper we present a security mechanism that seamlessly integrates with service discovery and usage. Exchange of keys and certificates is combined with messages used for service discovery. Services messages themselves are encrypted and authenticated, and casual receivers cannot read them. Although encryption and decryption of messages takes extra time, the combined protocol poses minimal communication overhead and hence can be used even in small devices.
Lazy instruction scheduling: keeping performance, reducing power
Authors: Ali Mahjur, Mahmud Taghizadeh, Amir Hossein Jahangir
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

An important approach to reduce power dissipation is reducing the number of instructions executed by the processor. To achieve this goal, this paper introduces a novel instruction scheduling algorithm that executes an instruction only when its result is required by another instruction. In this manner, it not only does not execute useless instructions, but also reduces the number of instructions executed after a mispredicted branch. The cost of the extra hardware is 161 bytes for 128 instruction window size. Measurements done using SPEC CPU 2000 benchmarks show that the average number of executed instructions is reduced by 13.5% while the average IPC is not affected.
A Case Study on Software Evolution towards Service-Oriented Architecture
Authors: Félix Cuadrado, Boni García, Juan C. Dueñas, Hugo A. Parada
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The evolution of any software product over its lifetime is unavoidable, caused both by bugs to be fixed and by new requirements appearing in the later stages of the product’s lifecycle. Traditional development and architecture paradigms have proven to be not suited for these continual changes, resulting in large maintenance costs. This has caused the rise of approaches such as Service Oriented Architectures (SOA), based on loosely coupled, interoperable services, aiming to address these issues. This paper describes a case study of the evolution of an existing legacy system towards a more maintainable SOA. The proposed process includes the recovery of the legacy system architecture, as a first step to define the specific evolution plan to be executed and validated. The case study has been applied to a medical imaging system, evolving it into a service model.
Equivalent transformations for invariant parallel functions
Authors: Mark Trakhtenbrot
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

Monotonic parallel functions were extensively studied in research on semantics of programming languages. While most of this research concentrated on expressive power of parallel functions, this paper focuses on development of a rich catalog of equivalent transformations associated with invariant parallel functions. Such functions are independent of interpretation of their definition domain, and they can be naturally used as additional control means to enrich models of sequential programs (such as recursive program schemes). It is shown how the offered transformations can be applied for a variety of goals, such as regularization of terms and reducing the strength of the used operations.
The problem of boundary conditions in seismic excitation of inhomogeneous infinite waveguides
Authors: Igor Špacapan
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

The analysis of the wave motion in a segment of the inhomogeneous wave guide excited by a given seismic excitation is presented, as well as some numerical cases of the interaction between the rigid foundation and the layer. The computational procedure yields exact results within the accuracy of the FE modeling, and directly uses the data of the free field seismic wave motion on the fictitious boundary where the computed reflected waves are considered in the boundary conditions. The basic principles of the analysis are explained, and brief outline of the procedure is presented. Numerical examples are for the case of 2D anti-plane shear wave motion in the frequency domain. The results of some simplified solutions are compared and discussed.
Solving a stochastic model for the hub location problem
Authors: Carmen Ramos, Rosa Ramos, Teresa Ramos
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

We present a two-stage full recourse mixed 0-1 model for the capacitated hub location-routing problem in a telecommunication network. The problem basically consists of designing the network connectivity, nodes processing and buffers capacities, edges flow capacities and enrouting protocols for meeting some criteria on the information flow from origins to destinations through the network that includes a set potential transhipment nodes also called hubs. The uncertainty in the O-D flow matrix is treated via scenario analysis. The main goal is to minimize a composite function of the expected lost information and the expected information flow path through the network.
Nonconvex fuzzy mappings and the fuzzy pre-variational inequality
Authors: Zezhong Wu, Jiuping Xu
Venue: Fuzzy Sets and Systems (2008)

In this paper, we introduce the concepts of fuzzy pseudoconvex, fuzzy invex, fuzzy pseudoinvex and fuzzy preinvex mapping from R^n to the set of fuzzy numbers, and put forward the concepts of fuzzy extended directional differential, subgradient and subdifferential. Some properties are obtained for fuzzy pseudoconvex, fuzzy invex, fuzzy pseudoinvex and fuzzy preinvex mapping; relations are discussed between the fuzzy pre-variational inequality and the fuzzy vector optimization problem.