ppxscal/embedding_network huggingface dataset:
Using random forests to uncover bivariate interactions in high dimensional small data sets
Authors: Jorge M. Arevalillo, Hilario Navarro
Venue: Proceedings of the KDD-09 Workshop on Statistical and Relational Learning in Bioinformatics (2009)

Random Forests (RF) is an ensemble method which has become widely accepted within the machine learning and bioinformatics communities in the last few years. Its predictive strength, along with some of the ingredients --- rich in information --- provided by the output, has made RF an efficient Data Mining tool for discovering patterns in data. In this paper we review the learning mechanism of RF within the classification setting and apply it to uncover bivariate interactions, carrying on useful information about an outcome, in high dimensional low sample data. We propose a divide and conquer search strategy in the variable space that benefits from the ranking of variable importances of RF at a first stage, along with the out of bag error rate (oob) of the ensemble at a second stage. The procedure combines both elements in order to capture difficult to uncover patterns in these type of data. We will show the performance of our procedure in some synthetic scenarios and will give a real application to a microarray data set in order to illustrate how it works.
Parallel Simulated Annealing for the Job Shop Scheduling Problem
Authors: Wojciech Bożejko, Jarosław Pempera, Czesław Smutnicki
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

This paper describes two parallel simulated annealing algorithms for the job shop scheduling problem with the sum of job completion times criterion. Some properties of the problem associated with the block theory have been presented and discussed. These properties allow us to introduce the effective neighborhood based on the adjacent swap type moves. In this paper, an original method for parallel calculation of optimization criterion value for set of solutions, recommended for the use in metaheuristics with single- and multiple- search trajectories is proposed. Additionally, the vector calculation method, that uses multiple mathematical instructions MMX supported by suitable data organization, is presented. Properties of parallel calculations are empirically verified on the PC with Intel Core 2 Duo processor on Taillard's benchmarks.
Collaborative Product Development: EADS Pilot Based on ATHENA Results
Authors: Nicolas Figay
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

ATHENA research program proposes innovative approach to address needs for interoperability of enterprise applications. It addresses in particular the area of Collaborative Product Design, for Aerospace but also other manufacturing sectors. Innovation comes from a holistic approach of the problem at enterprise, knowledge, ICT and semantic levels. It implies simultaneous advanced usage of technologies coming from various domains like enterprise modeling, Model Driven software engineering, Service Oriented Architecture, Collaborative Executable Business Process engineering and Semantic reconciliation. In the Aerospace sector, but also for numerous other industrial sectors (as automotive, furniture, ships, building…), current trend is to develop Product Life Cycle Management approaches across the virtual enterprise, with earlier consideration of downstream phases when designing product system, and important role of “Product Data Management”, “Product Data Exchange and Sharing” and “Change and Configuration Management processes”. This paper describes the used way to define accurate Aerospace Collaborative Product Development pilots, in order to reach ATHENA objectives in term of scientific achievement and business impact, and with as a result definition of a first set of pilots and a proposal for Networked Enterprise Collaborative Product Definition infrastructure.
Computationally efficient analysis of cable-stayed bridge for GA-based optimization
Authors: Venkat Lute, Akhil Upadhyay, K. K. Singh
Venue: Engineering Applications of Artificial Intelligence (2009)

Optimum design of a cable-stayed bridge structure is very complicated because of large number of design variables. Use of genetic algorithms (GAs) in optimizing such structure consumes significant computational time. Due to nonlinearity, structural analysis itself takes considerable computational time and the genetic algorithm has to perform a large number of iterations in order to obtain global minima. A new approach combining GA and support vector machine (SVM) has been adopted. This drastically reduces the computation time of optimization. The genetic algorithm is employed to obtain the minimum cost of the cable-stayed bridge. Constraint evaluation is done using SVM which is trained by a data base generated through FEM analysis. System level optimization is carried out considering configuration and cross-sectional parameters as design variables. In the present study, optimization was carried out for bridge lengths ranging from 100 to 500m. Final optimum designs were reanalyzed to check the adequacy of the developed approach.
Post metallization annealing study in La2O3/Ge MOS structure
Authors: J. Song, K. Kakushima, P. Ahmet, K. Tsutsui, N. Sugii, T. Hattori, H. Iwai
Venue: Microelectronic Engineering (2009)

The study on post metallization annealing (PMA) in electrical characteristics and interfacial properties of La"2O"3/Ge structures has been conducted. The PMA treatment in N"2 ambient induces the growth of interfacial Ge oxide layer accompanied with decrease of capacitance value and interface trap density. The interface-layer growth is caused by the oxidation of Ge substrate due to the hydroxyl group absorbed in La"2O"3 from the ambient. The metal electrode capping might prevent the hydroxyl from evaporating during annealing, which enhances the interface reaction. On the other hand, leakage current increment has been observed for the sample with PMA in case of using Pt gate electrode. It is due to the diffusion of Pt and/or Ge and a Pt-germanide formation in La"2O"3 film during PMA. This leakage current increment can be suppressed by using Ta or W electrode which has less reactivity with Ge than Pt at high temperature.
VBScript Programmer's Reference, 3rd edition
Authors: Adrian Kingsley-Hughes, Kathie Kingsley-Hughes, Daniel Read
Venue:  (2007)

Completely updated for Windows Vista and Windows Server 2003 R2, this book is packed with practical examples for today's programmer, Web developer, or system administrator Combines a comprehensive overview of the VBScript technology and associated technologies with sample code at every stage from beginner to advanced user Discusses the general syntax, functions, keywords, style, error handling, and similar language-specific topics and then moves into an expanded reference section covering the object models in detail Presents advanced coverage on Active Directory Service Interfaces (ADSI), PowerShell, security scripting, remote scripting, database scripting, and more
Frontier Search for Bicriterion Shortest Path Problems
Authors: L. Mandow, J. L. Pérez de la Cruz
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Frontier search is a new search technique that achieves important memory savings over previous best-first search algorithms. This paper describes an extension of frontier search to bicriterion graph search problems that achieves also important memory savings. The new algorithm is evaluated using a set of random problems.
Learning dictionaries of stable autoregressive models for audio scene analysis
Authors: Youngmin Cho, Lawrence K. Saul
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

In this paper, we explore an application of basis pursuit to audio scene analysis. The goal of our work is to detect when certain sounds are present in a mixed audio signal. We focus on the regime where out of a large number of possible sources, a small but unknown number combine and overlap to yield the observed signal. To infer which sounds are present, we decompose the observed signal as a linear combination of a small number of active sources. We cast the inference as a regularized form of linear regression whose sparse solutions yield decompositions with few active sources. We characterize the acoustic variability of individual sources by autoregressive models of their time domain waveforms. When we do not have prior knowledge of the individual sources, the coefficients of these autoregressive models must be learned from audio examples. We analyze the dynamical stability of these models and show how to estimate stable models by substituting a simple convex optimization for a difficult eigenvalue problem. We demonstrate our approach by learning dictionaries of musical notes and using these dictionaries to analyze polyphonic recordings of piano, cello, and violin.
The challenges of improving revenue-recognition standard for multiple-element firms: evidence from the software industry (sop 97-2)
Authors: Edward P. Swanson
Venue:  (2008)

I investigated whether implementing SOP 97-2, the revenue-recognition standard for the software industry, reduces earnings informativeness. This standard is particularly important for two reasons: First, its provisions coincide with provisions of SAB 101, the current general revenue-recognition standard. Second, the software industry provides a laboratory setting for examining multiple-element firms, whose revenue-recognition challenges keep mounting as more and more firms bundle multiple products and services. I found that implementing SOP 97-2 leads to additional revenue deferrals and a decline in earnings informativeness. However, the market prices these deferrals as revenues, as if these amounts had not been deferred. Moreover, the proforma earnings, which I calculated by undoing the revenue deferrals, more strongly correspond with market returns than do the reported earnings. My findings indicate that the accounting numbers calculated using the pre-SOP 97-2 revenue-recognition rules more strongly correspond with market returns than do those calculated using SOP 97-2. My findings should interest FASB in its project on developing a new revenue-recognition standard.
Delay aware link scheduling for multi-hop TDMA wireless networks
Authors: Petar Djukic, Shahrokh Valaee
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Time division multiple access (TDMA) based medium access control (MAC) protocols can provide QoS with guaranteed access to the wireless channel. However, in multi-hop wireless networks, these protocols may introduce scheduling delay if, on the same path, an outbound link on a router is scheduled to transmit before an inbound link on that router. The total scheduling delay can be quite large since it accumulates at every hop on a path. This paper presents a method that finds conflict-free TDMA schedules with minimum scheduling delay. We show that the scheduling delay can be interpreted as a cost, in terms of transmission order of the links, collected over a cycle in the conflict graph. We use this observation to formulate an optimization, which finds a transmission order with the min-max delay across a set of multiple paths. The min-max delay optimization is NP-complete since the transmission order of links is a vector of binary integer variables. We devise an algorithm that finds the transmission order with the minimum delay on overlay tree topologies and use it with a modified Bellman-Ford algorithm, to find minimum delay schedules in polynomial time. The simulation results in 802.16 mesh networks confirm that the proposed algorithm can find effective min-max delay schedules.
Chaos synchronization based on PI fuzzy observer
Authors: Ramy Farid, Abdul-Azim Ibrahim, Belal Abo-Zalam
Venue: Proceedings of the 10th WSEAS international conference on Fuzzy systems (2009)

In this paper, the synchronization problem of chaotic systems is solved in a presence of external disturbances, based on designing PI-fuzzy observer. The Takagi-Sugeno fuzzy models are given to exact represent chaotic systems. Then, the fuzzy model of many well-known chaotic systems is constructed with only one premise variable in fuzzy rules and the same premise variable in the system output. Based on this general model, the PI-fuzzy observer is designed. Then simulation results illustrate the robust performance of this observer in a presence of external disturbances.
A low cost vibrotactile array to manage respiratory motion
Authors: Ali Israr, Dillon P. Eng, Sastry S. Vedam, Marcia K. O'Malley
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

We present a tactile Respiratory Management System (tRMS) to manage and control breathing patterns of cancer patients undergoing radiation therapy. The system comprises of an array of small vibrating motors and a control box that supplies power to and provides a control interface for up to twelve motors through the parallel port of a standard personal computer. The vibrotactile array can be fastened along the forearm, arm, thigh, leg or abdomen in any configuration using Velcro and fabric wraps. All motors are operated in a binary fashion, i.e. on or off, with quick response time and perceivable vibration magnitudes. The tRMS system is inexpensive and portable, providing spatiotemporal variations in tactile cues to regulate respiratory motion during radiotherapy. The system will also be used in future psychophysical studies to determine effective use of tactile cues to control human motor actions.
Data-driven Block Ciphers for Fast Telecommunication Systems, 1st edition
Authors: Nikolai Moldovyan, Alexander A. Moldovyan
Venue:  (2007)

Nikolai Moldovyan and Alexander Moldovyan, holders of several dozen patents in encryption technology, provide the background and detail the applications needed to investigate new properties of PNs especially relevant to the improvement of modern wireless systems. They propose a universal architecture involving controlled bit permutation instruction that will permit the performance of both data-driven permutations and an arbitrary prescribed fixed permutation in a single cycle. Because of its simplicity and efficient use of current hardware, the embedding of this architecture is a highly attractive option for CPU manufacturers. Detailing all the relevant information into a single volume,this book makes that option more feasible than ever.
Compensation-aware data types in RDBMS
Authors: Aravind Yalamanchi, Dieter Gawlick
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

In a traditional database system, the transaction management protocols and mechanisms are constrained by the fundamental properties of atomicity, consistency, isolation, and durability (ACID). A transaction management system with strict ACID properties typically employs read and write locks, held for the duration of the transaction, to protect its uncommitted data from being seen and modified by some other transaction. While this approach is effective for applications involving short execution times and relatively small number of concurrent operations, it is too restrictive for applications that involve reactive, long-lived, and complex transactions. The common denominator of such applications is the need for transactions to read and possibly modify uncommitted data values [1] and for the database system to still retain the ability to abort a transaction and the ability to recover from failures. This paper proposes a Business Transaction framework that allows long lasting, discontinuous, and resumable transactions to perform shared updates to common data by holding semantic locks on the modified rows. Under this framework, basic SQL data types are made compensation-aware by associating domain-specific shared update semantics with them. These semantics ensure that each data modification operation is compatible with other uncommitted activity on the same data and that the operation can be undone, if needed, without resorting to cascading aborts. This paper describes the key concepts and presents our approach for supporting shared updates in Oracle RDBMS.
Computational methods for static allocation and real-time redeployment of ambulances
Authors: Mateo Restrepo
Venue:  (2008)

We propose new approaches to tackle the problems of static and dynamic ambulance fleet allocation. Static ambulance fleet allocation refers to deciding on home bases for ambulances, to which they return after serving calls. The number and location of bases are given. The goal is to keep response times to calls as small as possible. The first part introduces two models for this problem. Both of them are based on the Erlang loss formula. The first model is stylized and serves to illustrate that allocating ambulances to bases in proportion to base offered load is often non-optimal. The second model is similar in spirit to queueing theoretical models developed in the past but uses the Erlang loss function as a key ingredient. A careful computational comparison shows that the predictions obtained from our model are often more accurate than those produced by previous models, especially in low utilization regimes. This model can be used as a prescreening tool to find promising candidate allocations to be further evaluated through detailed simulation. Dynamic redeployment concerns the real-time relocation of idle ambulances so as to ensure better preparedness. The second part of this dissertation formulates this problem as a dynamic program in a high-dimensional and uncountable state space, and then resort to approximate dynamic programing (ADP) techniques to obtain approximate solutions. To this end, a specially tailored approximation architecture for the problem is developed. The architecture depends on a small number of free parameters which are tuned using simulated cost trajectories of the system and linear regression. Computational experiments show that the relocation policies obtained from this approach offer significant performance improvements relative to benchmark static-relocation policies. In the third part we use the linear programming approach to ADP on the dynamic-redeployment problem, using the previously developed approximation architecture. We conclude that, although the policies obtained are comparable in quality to those obtained using regression, there are serious issues related to numerical stability. Furthermore, the amount of computation required makes this approach less practical than the regression-based one.
Group Metacognition in a Computer-Supported Collaborative Learning Environment
Authors: Chris Chalmers, Rod Nason
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This study investigated within-group metacognition during group problem solving conducted within the context of a Knowledge Forum© CSCL learning environment. Three malfunctioning groups of students from a middle-grade primary school in an inner-city school in eastern Australia participated in this study. Prior to the study, the majority of the groups' time at the computer was spent on non-productive conflict. During the study, the three groups were provided with group strategies and metacognitive scaffolds to facilitate group metacognition. The scaffolds and strategies used were derived from the literature on metacognition, co-operative learning, problem solving, and computer-supported collaborative learning. The study found that providing students with metacognitive scaffolds and group strategies resulted in positive changes in the students' group work at the computer. The students developed an understanding of how to contribute effectively to their group which enhanced the groups' problem solving and knowledge-building.
EuQoS: End-to-End Quality of Service over Heterogeneous Networks
Authors: E. Mingozzi, G. Stea, M. A. Callejo-Rodríguez, J. Enríquez-Gabeiras, G. García-de-Blas, F. J. Ramón-Salquero, W. Burakowski, A. Beben, J. Sliwinski, H. Tarasiuk, O. Dugeon, M. Diaz, L. Baresse, E. Monteiro
Venue: Computer Communications (2009)

The EuQoS (End-to-End QoS over Heterogeneous Networks) IST Integrated European Project aimed to define a Next Generation Network architecture that builds, uses and manages end-to-end QoS across different administrative domains and heterogeneous networks (UMTS, xDSL, Ethernet, WiFi, Satellite and IP/MPLS). The EuQoS architecture preserves the openness and the decentralized decision model of the actual Internet, runs on off-the-shelf hardware and network equipment, and allows end users to request various services without changing the Application Signaling protocol, while meeting regulators' and users' Net Neutrality requirements. This paper presents the key elements of the EuQoS architecture and describes the main results obtained in field trials performed on a fully-functional EuQoS system prototype developed over a pan-European testbed. Furthermore, the paper discusses the main strengths of the system and the issues related to its actually deployment on a large scale, from both technical and market points of view.
Cryptanalysis of a knapsack-based probabilistic encryption scheme
Authors: Amr M. Youssef
Venue: Information Sciences: an International Journal (2009)

Wang et al. [B. Wang, Q. Wu, Y. Hu, A knapsack-based probabilistic encryption scheme, Information Sciences 177(19) (2007) 3981-3994] proposed a high density knapsack-based probabilistic encryption scheme with non-binary coefficients. In this paper, we present a heuristic attack that can be used to recover the private key parameters from the known public key parameters. In particular, we show that the restrictions imposed on the system parameters allow the attacker to recover a short list of candidates for the first half of the public key. The second half of the public key can then be recovered using an attack based on lattice basis reduction. Finally, by encrypting an arbitrary plaintext using the known public key then decrypting the resulting ciphertext using these estimated candidate solutions, the right private key can be uniquely determined.
Auto-correlation wavelet support vector machine
Authors: G. Y. Chen, G. Dudek
Venue: Image and Vision Computing (2009)

A support vector machine (SVM) with the auto-correlation of a compactly supported wavelet as a kernel is proposed in this paper. The authors prove that this kernel is an admissible support vector kernel. The main advantage of the auto-correlation of a compactly supported wavelet is that it satisfies the translation invariance property, which is very important for its use in signal processing. Also, we can choose a better wavelet by selecting from different wavelet families for our auto-correlation wavelet kernel. This is because for different applications we should choose wavelet filters selectively for the autocorrelation kernel. We should not always select the same wavelet filters independent of the application, as we demonstrate. Experiments on signal regression and pattern recognition show that this kernel is a feasible kernel for practical applications.
Editors&#x2019; foreword
Authors: Jacques Calmet, Fran&#x00e7;ois Ollivier
Venue: Applicable Algebra in Engineering, Communication and Computing (2009)

No abstract