ppxscal/embedding_network huggingface dataset:
A distributed localization scheme for wireless sensor networks
Authors: Prasan Kumar Sahoo, I-Shyan Hwang, Shi-Yao Lin
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Localization of the nodes in Wireless sensor networks (WSNs) is an important research issue, since it can enhance the efficiency in computation and minimize the power consumption of the nodes. In this paper, a novel localization algorithm is proposed to estimate the location information of the normal nodes with help of few beacon nodes and angle information of the anchor nodes. Our localization scheme can use at most three beacon nodes to find location information of any normal node in a distributed manner. Besides, we give the theoretical basis for determining the localization error using probability distribution function. Our performance analysis shows that there is a tradeoff between deployed number of beacon nodes and localization error and average localization time of the network can be increased with deployed number of normal nodes.
Convergence and tracking analysis of a variable normalised LMF (XE-NLMF) algorithm
Authors: Azzedine Zerguine, Mun K. Chan, Tareq Y. Al-Naffouri, Muhammad Moinuddin, Colin F. N. Cowan
Venue: Signal Processing (2009)

The least-mean-fourth (LMF) algorithm is known for its fast convergence and lower steady state error, especially in sub-Gaussian noise environments. Recent work on normalised versions of the LMF algorithm has further enhanced its stability and performance in both Gaussian and sub-Gaussian noise environments. For example, the recently developed normalised LMF (XE-NLMF) algorithm is normalised by the mixed signal and error powers, and weighted by a fixed mixed-power parameter. Unfortunately, this algorithm depends on the selection of this mixing parameter. In this work, a time-varying mixed-power parameter technique is introduced to overcome this dependency. A convergence analysis, transient analysis, and steady-state behaviour of the proposed algorithm are derived and verified through simulations. An enhancement in performance is obtained through the use of this technique in two different scenarios. Moreover, the tracking analysis of the proposed algorithm is carried out in the presence of two sources of nonstationarities: (1) carrier frequency offset between transmitter and receiver and (2) random variations in the environment. Close agreement between analysis and simulation results is obtained. The results show that, unlike in the stationary case, the steady-state excess mean-square error is not a monotonically increasing function of the step size.
Art Competition: Agent Designs to Handle Negotiation Challenges
Authors: Andrew Diniz Da Costa, Carlos J. Lucena, Viviane Torres Da Silva, Sérgio C. Azevedo, Fábio A. Soares
Venue: Trust in Agent Societies: 11th International Workshop, TRUST 2008, Estoril, Portugal, May 12 -13, 2008. Revised Selected and Invited Papers (2008)

Multi-Agent Systems are societies in which autonomous and heterogeneous entities can work together to achieve similar or different goals. However, it is often a difficult task to perceive when an agent can be trusted to perform a specific negotiation. In other words, to establish its reputation. For that purpose, a number of models and strategies have been studied and proposed in the literature. The AAMAS Agent Reputation Trust (ART) Testbed competition has been created to make it possible to compare different strategies. This is achieved through an environment for agent-based simulation games. In the second and third edition of ART that took place in 2007 and 2008, new models and strategies emerged that incorporated important research contributions to the field. In this paper, we provide the description of the main set of concerns that we took into consideration to create competitive strategies for such versions of ART.
Ranking L-R fuzzy number based on deviation degree
Authors: Zhong-Xing Wang, Yong-Jun Liu, Zhi-Ping Fan, Bo Feng
Venue: Information Sciences: an International Journal (2009)

This paper proposed a novel approach to ranking fuzzy numbers based on the left and right deviation degree (L-R deviation degree). In the approach, the maximal and minimal reference sets are defined to measure L-R deviation degree of fuzzy number, and then the transfer coefficient is defined to measure the relative variation of L-R deviation degree of fuzzy number. Furthermore, the ranking index value is obtained based on the L-R deviation degree and relative variation of fuzzy numbers. Additionally, to compare the proposed approach with the existing approaches, five numerical examples are used. The comparative results illustrate that the approach proposed in this paper is simpler and better.
Data-server design issues
Authors: Fred Maryanski
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The expected proliferation of local-area networks has created a need for network database servers. It is reasonable to view local-area network data servers as extensions of backend database systems. This paper addresses several critical data-server design issues: distribution of functionality, high availability, security, and performance. Particular consideration is given to applying experience with backend databases to the problems of data servers. Several design alternatives are proposed and evaluated in terms of their impact on reliability, security, and performance in a gross sense. The concluding section emphasizes the need for greater practical experience with local-area networks in order to more accurately weigh the tradeoffs of different data-server configurations.
Information Structure in a Formal Framework
Authors: Maarika Traat
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

This paper presents Unification-based Combinatory Categorial Grammar (UCCG): a grammar formalism that combines insights from Combinatory Categorial Grammar with feature structure unification. Various aspects of information structure are incorporated in the compositional semantics. Information structure in the semantic representation is worked out in enough detail to allow for the determination of accurate placement of pitch accents, making the representation a suitable starting point for speech generation with context appropriate intonation. UCCG can be used for parsing and generating prosodically annotated text, and uses a semantic representation that is compatible with the currently available `off-the-shelf' automatic inference tools. As such the framework has the potential to advance spoken dialogue systems. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
On the Hybridization of Constraint Programming and Local Search Techniques: Models and Software Tools
Authors: Raffaele Cipriano
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Resource management problems are generally modeled as Constraint Satisfaction / Optimization Problems (CSPs or COPs). The solution methods for CSPs and COPs can be split into: complete methods, which systematically explore the whole solution space; incomplete methods, which rely on heuristics and focus on interesting areas of the solution space. Our focus is manly in Constrain Programming (CP) and Local Search (LS) techniques. CP languages are usually based on complete methods that analyze the search space alternating constraint propagation phases and variable assignment phases. Their main advantage is flexibility. LS methods, instead, rely on the definition of "proximity" and explore only specific areas of the search space. Their main advantage is efficiency.
Employee turnover: a novel prediction solution with effective feature selection
Authors: Hsin-Yun Chang
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

This study proposed to address a new method that could select subsets more efficiently. In addition, the reasons why employers voluntarily turnover were also investigated in order to increase the classification accuracy and to help managers to prevent employers' turnover. The mixed subset selection used in this study combined Taguchi method and Nearest Neighbor Classification Rules to select subset and analyze the factors to find the best predictor of employer turnover. All the samples used in this study were from industry A, in which the employers left their job during 1st of February, 2001 to 31st of December, 2007, compared with those incumbents. The results showed that through the mixed subset selection method, total 18 factors were found that are important to the employers. In addition, the accuracy of correct selection was 87.85% which was higher than before using this subset selection (80.93%). The new subset selection method addressed in this study does not only provide industries to understand the reasons of employers' turnover, but also could be a long-term classification prediction for industries.
Efficient provenance storage over nested data collections
Authors: Manish Kumar Anand, Shawn Bowers, Timothy McPhillips, Bertram Ludäscher
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Scientific workflow systems are increasingly used to automate complex data analyses, largely due to their benefits over traditional approaches for workflow design, optimization, and provenance recording. Many workflow systems employ a simple dependency model to represent the provenance of data produced by workflow runs. Although commonly adopted, this model does not capture explicit data dependencies introduced by "provenance-aware" processes, and it can lead to inefficient storage when workflow data is complex or structured. We present a provenance model, extending the conventional approach, that supports (i) explicit data dependencies and (ii) nested data collections. Our model adopts techniques from reference-based XML versioning, adding annotations for process and data dependencies. We present strategies and reduction techniques to store immediate and transitive provenance information within our model, and examine trade-offs among update time, storage size, and query response time. We evaluate our approach on real-world and synthetic workflow execution traces, demonstrating significant reductions in storage size, while also reducing the time required to store and query provenance information.
To Become an Oracle DBA in Eighty Days
Authors: Fly Balloon
Venue:  (2007)

The book To Become an Oracle DBA in Eighty Days explains the concepts of oracle database using the stories from Jules Verne's novel Around the World in 80 Days: One Oracle Database Architecture Two Oracle Network Configuration 2.1. Client Request 2.2. Network Configuration Files 2.3. Listener Static and Dynamic Register 2.4. Listener Failover and Load Balance Three Database Grid Control 3.1. Grid Control Structure 3.2. Event and Notification 3.3. Scheduled Job Four Backup, Recovery and RMAN 4.1. System Change Number (SCN) 4.2. Online Backup 4.3. Recovery 4.4. Oracle Recovery Manager (RMAN) Five Oracle Real Application Cluster (RAC) 5.1. Physical Structure 5.2. Resource Coordination 5.3. Cache Fusion Six Performance Tuning
Optimal predictive densities and fractional moments
Authors: Emanuele Taufer, Sudip Bose, Aldo Tagliani
Venue: Applied Stochastic Models in Business and Industry (2009)

The maximum entropy approach used together with fractional moments has proven to be a flexible and powerful tool for density approximation of a positive random variable. In this paper we consider an optimality criterion based on the Kullback&ndash;Leibler distance in order to select appropriate fractional moments. We discuss the properties of the proposed procedure when all the available information comes from a sample of observations. The method is applied to the size distribution of the U.S. family income. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Fast implementation of cel-based animation
Authors: Man Qi, Maozhen Li, Philip Willis
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

The computational Grid is a promising platform for the deployment of large-scale scientific and engineering application. This paper presents a Quasi-3D (almost true 3D) animation system using either 2D geometric shapes or raster images (cels) as input primitives. Rendering high-quality computer images requires intensive computation, and therefore a large amount of time. To speed up the rendering process, a Grid environment has been constructed with Globus and Condor in which a large number of animation frames can be rendered simultaneously using disparate Grid resources. The results show that the rendering performance has been highly improved using the Grid environment.
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
Authors: Jochen Könemann, Ojas Parekh, David Pritchard
Venue: Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers (2009)

We consider the max-weight integral multicommodity flow problem in trees. In this problem we are given an edge-capacitated tree and weighted pairs of terminals, and the objective is to find a max-weight integral flow between terminal pairs subject to the capacities. This problem was shown to be $\mathcal{\mathsf{APX}}$-hard by Garg, Vazirani and Yannakakis [Algorithmica, 1997], and a 4-approximation was given by Chekuri, Mydlarz and Shepherd [ACM Trans. Alg., 2007]. Some special cases are known to be exactly solvable in polynomial time, including when the graph is a path or a star. First, when every edge has capacity at least &mu;&thinsp;&ge;&thinsp;2, we use iterated LP relaxation to obtain an improved approximation ratio of min {3, 1&thinsp;+&thinsp;4/&mu;&thinsp;+&thinsp;6/(&mu; 2&thinsp;&minus;&thinsp;&mu;)}. We show this ratio bounds the integrality gap of the natural LP relaxation. A complementary hardness result yields a 1&thinsp;+&thinsp;&Theta;(1/&mu;) threshold of approximability (if P&thinsp;&ne;&thinsp;NP). Second, we extend the range of instances for which exact solutions can be found efficiently. When the tree is a spider (i.e. if only one vertex has degree greater than 2) we give a polynomial-time algorithm to find an optimal solution, as well as a polyhedral description of the convex hull of all integral feasible solutions.
Status Sensitive Components: Adapting Rich Internet Applications to Their Runtime Context
Authors: Norbert Heidenbluth, Franz Schweiggert
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

Nowadays, Rich Internet Applications (RIAs) gain more and more popularity. They allow to deliver internet applications that offer a user expericence known from desktop applications. Since in traditional browser centric internetapplications the server delivers the content that is to be displayed, the applications can flexibly adapt their functionality to the application’s state and context (e.g. the permissions granted to the current user) at any time. As for RIAs, things are different. Normally, they exist in a pre-compiled form—for example as a swf-file. Therefore, they don’t allow any dynamic customization of their functionality during runtime. However, it would be eligible that components used in a RIA (e.g. navigation structures) are able to adapt automatically—whenever any change in the application’s state or context occurs—to that new state or context. Thus, the RIA components could provide a view onto the application that is totally in sync with its current status and context. In this paper, we present a pattern which allows an easy implementation of this behavior. Then we will show a case study where this pattern has been applied successfully.
Consistency checking of role assignments in inter-organizational collaboration
Authors: Paul El Khoury, Emmanuel Coquery, Mohand-Said Hacid
Venue: Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS (2008)

The establishment of globalization is driving inter- organizational collaboration towards a necessity. We cannot expect total conformity between organizations nor homogeneous security settings. Nevertheless, each organization, with its own security policies, needs to exchange data. Employees involved in inter-organizational tasks shall require remote access to data hosted by other organizations. Administrating access control policies for those employees creates problems for security officers, particularly for role assignments. Flexibility in extending (or restricting) permissions for roles imported from other organizations is required. In this work, we present an approach based on Description Logic formalisms to create from the inter-organizational agreement a set of bridge rules that in addition to (i) the permissions assigned to a given role from one organization and (ii) the permissions assigned to another role in the other organization, allows security officers to check consistency of the resulting combination of roles from both organizations.
Building the academic strategy program
Authors: Petko Ruskov, Yanka Todorova
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

Purpose -- to present the application of a theory and best practice of a balanced scorecard BSC method, to create BSC strategic program for academic education decision makers, and to present framework for strategy program about research and education in faculty. Methodology/approach -- based on the investigation of number of successful project on this topic and on the authors exercise in balanced scorecard approach about educational strategy the program is created and modelled. Findings -- the balanced scorecard strategic program is developed and it allows enhancing the leadership capability across university. Practical implications -- the program can facilitate faculty and staff to formulate and measure strategic management decisions and to create competitive educational and research environment at the university. Originality/value -- the value of the program is in integrating competences, experience, best practices and tools within one new program design. The paper shows how to translate the academic strategy into different strategic objectives and goals, how to model them and how to communicate academic research and education processes to realize important improvements in cost and quality of academic services.
Why Developers Insert Security Vulnerabilities into Their Code
Authors: Kaarina Karppinen, Lyly Yonkwa, Mikael Lindvall
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

Modern software systems are difficult to test due to their distributed nature, and increased security complicates testing even further. Our hypothesis is that some security vulnerabilities are actually introduced due to developers’ need to facilitate testing that software requirements have been implemented correctly. If these temporary security vulnerabilities are not removed before the software is delivered, there is a great risk that they may become fielded security vulnerabilities.In this paper, we study the relationship between such security vulnerabilities and developers' need to improve the testability of an application to facilitate unit and integration testing. We trace detected vulnerabilities to characteristics of the software that made testing difficult and therefore led to testability improvements. We discuss how the need to increase testability may relate to a form of developer usability, and what the ways of dealing with the problem of security vulnerabilities as a consequence of increasing testability are.
The impact of time delays on the robustness of biological oscillators and the effect of bifurcations on the inverse problem
Authors: Nicole Radde
Venue: EURASIP Journal on Bioinformatics and Systems Biology (2009)

Differential equation models for biological oscillators are often not robust with respect to parameter variations. They are based on chemical reaction kinetics, and solutions typically converge to a fixed point. This behavior is in contrast to real biological oscillators, which work reliably under varying conditions. Moreover, it complicates network inference from time series data. This paper investigates differential equation models for biological oscillators from two perspectives. First, we investigate the effect of time delays on the robustness of these oscillator models. In particular, we provide sufficient conditions for a time delay to cause oscillations by destabilizing a fixed point in two-dimensional systems. Moreover, we show that the inclusion of a time delay also stabilizes oscillating behavior in this way in larger networks. The second part focuses on the inverse problem of estimating model parameters from time series data. Bifurcations are related to nonsmoothness and multiple local minima of the objective function.
Case Study: Making the Move to AJAX
Authors: Jeff Norwalk
Venue: Queue (2009)

What a software-as-a-service provider learned from using an AJAX framework for RIA development
Conflicting Congestion Effects in Resource Allocation Games
Authors: Michal Feldman, Tami Tamir
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We consider resource allocation games with heterogeneous users and identical resources. Most of the previous work considered cost structures with either negative or positive congestion effects. We study a cost structure that encompasses both the resource's load and the job's share in the resource's activation cost.We consider the proportional sharing rule, where the resource's activation cost is shared among its users proportionally to their lengths. We also challenge the assumption regarding the existence of a fixed set of resources, and consider settings with an unlimited supply of resources.We provide results with respect to equilibrium existence, computation, convergence and quality. We show that if the resource's activation cost is shared equally among its users, a pure Nash equilibrium (NE) might not exist. In contrast, under the proportional sharing rule, a pure NE always exists, and can be computed in polynomial time. Yet, starting at an arbitrary profile of actions, best-response dynamics might not converge to a NE. Finally, we prove that the price of anarchy is unbounded and the price of stability is between 18/17 and 5/4.
Bark scale-based perceptual matching pursuit for improving sinusoidal audio modeling
Authors: P. Vera-Candeas, N. Ruiz-Reyes, F. López-Ferreras
Venue: Digital Signal Processing (2009)

In this paper we propose an improved sinusoidal modeling method based on perceptual matching pursuits computed in the bark scale for parametric audio coding applications. Complex exponentials compose the overcomplete dictionary for matching pursuits. The main contribution is the minimization of a perceptual distortion measure defined in the bark scale to select the optimum atom at each iteration of the pursuits. Furthermore, a psychoacoustic stopping criterion for the pursuits is presented. The proposed sinusoidal modeling method is suitable to be integrated into a parametric audio coder based on the three-part model of sines, transients and noise (STN model), as can be appreciated in experimental results. Our method provides significant advantages regarding previous works mainly because it operates in the bark scale rather than in frequency domain.