ppxscal/embedding_network huggingface dataset:
A Model Conditioned Data Compression Based Similarity Measure
Authors: D. Cerra, M. Datcu
Venue: Proceedings of the Data Compression Conference (2008)

Many methodologies and similarity measures based on data compression have been recently introduced to compute similarities between general kinds of data. Two important similarity indices are the Normalized Compression Distance (NCD), and the Pattern Recognition based on Data Compression (PRDC). At first sight NCD and PRDC are quite different: the former is a direct metric while the latter is a methodology which computes a compression distance with an intermediate step of encoding files into texts. In spite of this, it is possible to demonstrate that they are both based on estimates of Kolmogorov complexities (when this is known for the former but not for the latter). Finally, this results in the definition of a new measure: the Model Conditioned Data Compression based Similarity Measure (McDCSM), which is a modified version of PRDC. Thus, we found a link between PRDC and NCD: this allows inferring methods used in the computation of the former into other distance measures by adding intermediate steps that may improve the accuracy of the obtained results.
Modeling of electrodialysis using neural network
Authors: Mohtada Sadrzadeh, Toraj Mohammadi, Javad Ivakpour, Norollah Kasiri
Venue: Proceedings of the 1st WSEAS International Conference on Computational Chemistry (2007)

In this paper, separation of lead ions with the aid of a laboratory scale electrodialysis (ED) cell was modeled using artificial neural network (ANN) technique. Separation percent (SP) of lead ions was predicted at various concentrations (100, 500, and 1000 ppm), temperatures (25, 40, and 60°C), flow rates (0.07, 0.7, and 1.2 mL/s) and voltages (10, 20, and 30 V). An ANN structure with two hidden layers (4:5:4:1) was used for prediction. The modeling results showed that there is an excellent agreement between the experimental data and the predicted values, with mean absolute errors less than 1%. ANN modeling technique was found out to have many favorable features such as efficiency, generalization and simplicity, which make it an attractive choice for modeling of complex systems, such as wastewater treatment processes.
Why and How to Perform Fraud Experiments
Authors: Markus Jakobsson, Nathaniel Johnson, Peter Finn
Venue: IEEE Security and Privacy (2008)

The authors argue that user studies are vital in order to improve our understanding of online fraud and other sociotechnical security problems. They then provide an overview of common approaches and describe how to carry out the approach that they believe results in the most accurate measurements, the so-called naturalistic phishing experiment. They give examples of such experiments, and illustrate ethical and technical issues that may arise for such experiments.
Secure Authentication on WiMAX with Neural Cryptography
Authors: Dong Hu, YuYan Wang
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

The paper presents an new authentication method on WiMAX, which is a new and hot research point for telecommunication and computer scientist. In the IEEE 802.11 technology, security was added later while IEEE 802.16 considered the security issues during the design of the protocol. However, security mechanism of the IEEE 802.16 still remains a question. WiMAX is relatively a new technology and does not deployed widely to justify the evidence of threats, risk and vulnerability in real situations. We discuss the authentication design based on neural cryptography in the end.
Designing for nomadic work
Authors: Norman Makoto Su, Gloria Mark
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

Nomadic work, an extreme form of mobile work, is becoming increasingly prevalent in organizations. Yet so far there has not been enough research attention on the particular challenges that nomadic workers face in order to design support for their work practices. We employed ethnographic interviews and observations to understand nomadic work practices. Drawing from strategies for survival of pastoralist nomads to guide our design investigation, we focus on an integrated perspective of nomadic work involving challenges related to assembling actants, seeking resources, and integrating with others in the organization. We discovered that nomadic workers need to continually seek out and compete for resources to maintain their mobile offices. They also face challenges in integrating into the organization to maintain visibility and to synchronize with others for meeting. We discuss the design recommendations that emerged from our investigation.
A new paradigm for synthesis and propagation of clock gating conditions
Authors: Ranan Fraer, Gila Kamhi, Muhammad K. Mhameed
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Clock gating has become a standard practice for saving dynamic power in the clock network. Due to design reuse, it is common to find designs that have already some partial clock gating. We propose to exploit the existing clock gating in order to extract stronger gating conditions for blocks that are poorly gated or not gated at all. A second contribution of our paper is a robust and scalable approach to extract stability conditions for clock gating. Finally, we present a uniform treatment of unobservability and stability as dual approaches for propagating gating conditions forward and backward. Experimental results demonstrate significant power reduction (in the range of 14% -- 55% of the clock power) on Intel micro-processor designs.
Helping satisfy multiple objectives during a service desk conversation
Authors: Ullas Nambiar, Himanshu Gupta, Raju Balakrishnan, Mukesh Mohania
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Agents manning a service desk have the unenviable task of satisfying multiple conflicting objectives. Specifically, businesses require the agents to meet pre-specified customer satisfaction levels while keeping the cost of operations low or meeting sales targets, objectives that end up being complementary. Additional complexity is introduced by the fact that the objectives are often inter-dependent and have to be met in real-time. Moreover, business might change the objectives from time to time e.g. from reducing cost of operation to increasing sales of slow moving product. In this paper, we describe CallAssist - a speech enabled real-time dialog management system that dynamically helps agents in building a conversation that meets the various business objectives while satisfying customer requirements. An added benefit of our solution is the ability to adapt to changing business needs without incurring agent re-training costs. We provide evaluation results displaying the efficiency and effectiveness of our system.
Genetic Programming for detecting rhythmic stress in spoken English
Authors: Peter Andreae, Huayang Xie, Mengjie Zhang
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2008)

Rhythmic stress detection is an important but difficult problem in speech recognition. This paper describes an approach to the automatic detection of rhythmic stress in New Zealand spoken English using a linear genetic programming system with speaker independent prosodic features and vowel quality features as terminals to classify each vowel segment as stressed or unstressed. In addition to the four standard arithmetic operators, this approach also uses other functions such as trigonometric and conditional functions in the function set to cope with the complexity of the task. The error rate on the training set is used as the fitness function. The approach is examined and compared to a decision tree approach and a support vector machine approach on a speech data set with 703 vowels segmented from 60 female adult utterances. The genetic programming approach achieved a maximum average accuracy of 92.6%. The results suggest that the genetic programming approach developed in this paper outperforms the decision tree approach and the support vector machine approach for stress detection on this data set in terms of the detection accuracy, the ability of handling redundant features, and the automatic feature selection capability.
Positive integer powers for one type of tridiagonal matrices with zero row
Authors: Jonas Rimas
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

The general expression of the l-th power (l ∈ N, l ≥ 2) for one type of tridiagonal matrices of order n = 2p (p ∈ N, p ≥ 2) with zeros in the first row is derived. Expressions of eigenvectors of the matrix and of the transforming matrix and its inverse are given, too.
Scientific programming in Fortran
Authors: W. Van Snyder
Venue: Scientific Programming (2007)

The Fortran programming language was designed by John Backus and his colleagues at IBM to reduce the cost of programming scientific applications. IBM delivered the first compiler for its model 704 in 1957. IBM's competitors soon offered incompatible versions. ANSI (ASA at the time) developed a standard, largely based on IBM's Fortran IV in 1966. Revisions of the standard were produced in 1977, 1990, 1995 and 2003. Development of a revision, scheduled for 2008, is under way. Unlike most other programming languages, Fortran is periodically revised to keep pace with developments in language and processor design, while revisions largely preserve compatibility with previous versions. Throughout, the focus on scientific programming, and especially on efficient generated programs, has been maintained.
A study of awareness in multimedia search
Authors: Robert Villa, Nicholas Gildea, Joemon M. Jose
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Awareness of another's activity is an important aspect of facilitating collaboration between users, enabling an "understanding of the activities of others"[1]. Techniques such as collaborative filtering enable a form of asynchronous awareness, providing recommendations generated from the past activity of a community of users. In this paper we investigate the role of awareness and its effect on search behavior in collaborative multimedia retrieval. We focus on the scenario where two users are searching at the same time on the same task, and via the interface, can see the activity of the other user. The main research question asks: does awareness of another searcher aid a user when carrying out a multimedia search session? To encourage awareness, an experimental study was designed where two users were asked to find as many relevant video shots as possible under different awareness conditions. These were individual search (no awareness of each other), mutual awareness (where both user's could see each other's search screen), and unbalanced awareness (where one user is able to see the other's screen, but not vice-versa). Twelve pairs of users were recruited, and the four worst performing TRECVID 2006 search topics were used as search tasks, under four different awareness conditions. We present the results of this study, followed by a discussion of the implications for multimedia digital library systems.
Mapping severe damage to land cover following the 2004 Indian Ocean tsunami using moderate spatial resolution satellite imagery
Authors: A. S. Belward, H. -J. Stibig, H. Eva, F. Rembold, T. Bucha, A. Hartley, R. Beuchle, D. Khudhairy, M. Michielon, D. Mollicone
Venue: International Journal of Remote Sensing (2007)

Visual analysis of Moderate Resolution Imaging Spectroradiometer (MODIS) 250m before-and-after event imagery along 11 335 km of South East Asia and East Africa's coastline identified major changes to land cover along 1 220 km of coast caused by the tsunami of 26 December 2004. Over 81 000 ha of land were mapped as lost or severely damaged. High spatial resolution images (10-32 m) from the Terra satellite's Advanced Spaceborne Thermal Emission and Reflection Radiometer, Disaster Monitoring Constellation's Surrey Linear Imager and the Landsat Enhanced Thematic Mapper (ETM) provided verification. Area estimates of damaged land from MODIS were within 17% of the estimates made using high spatial resolution systems. Errors of commission and omission were estimated at 14% and 31%, respectively. The correlation between damage estimates from MODIS and high spatial resolution systems resulted in an R 2 of 0.73 at the 99.5% confidence level, with MODIS proving especially effective at mapping tsunami-damaged areas greater in size than 150 ha. Correcting the original area estimate to account for errors of omission and commission using the regression model gave a revised figure of 103 854 ha of land damaged. Land cover types could not be assigned from the MODIS pre-and post-disaster image pairs, but interpretation of pre-disaster ETM imagery for the damaged areas indicated that around 5% was previously classed as barren, 11% as urban, 14% forest and 70% rural. The study provides confirmation that moderate resolution satellite imagery can provide rapid assessments of severe damage to land resources (though not cover type), as well as confirmation of non-affected areas, over very large geographical regions in the aftermath of natural disasters such as the tsunami.
Talk and work: a preliminary report
Authors: David S. Pattison, Christian A. Bird, Premkumar T. Devanbu
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

Developers in Open Source Software (OSS) projects communicate using mailing lists. By convention, the mailing lists used only for task-related discussions, so they are primarily concerned with the software under development, and software process issues (releases, etc.). We focus on the discussions concerning the software, and study the frequency with which software entities (functions, methods, classes, etc) are mentioned in the mail. We find a strong, striking, cumulative relationship between this mention count in the email, and the number of times these entities are included in changes to the software. When we study the same phenomena over a series of time-intervals, the relationship is much less strong. This suggests some interesting avenues for future research.
Measurement-based admission control at edge routers
Authors: Seung Yeob Nam, Sunggon Kim, Dan Keun Sung
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality of service (QoS). In this paper, we develop a scalable architecture and an algorithm for admission control of real-time flows. Since individual management of each traffic flow on each transit router can cause a fundamental scalability problem in both data and control planes, we consider that each flow is classified at the ingress router and data traffic is aggregated according to the class inside the core network as in a DiffServ framework. In our approach, admission decision is made for each flow at the edge (ingress) routers, but it is scalable because per-flow states are not maintained and the admission algorithm is simple. In the proposed admission control scheme, an admissible bandwidth, which is defined as the maximum rate of a flow that can be accommodated additionally while satisfying the delay performance requirements for both existing and new flows, is calculated based on the available bandwidth measured by edge routers. The admissible bandwidth is a threshold for admission control, and thus, it is very important to accurately estimate the admissible bandwidth. The performance of the proposed algorithm is evaluated by taking a set of simulation experiments using bursty traffic flows.
Indexing through laplacian spectra
Authors: M. Fatih Demirci, Reinier H. van Leuken, Remco C. Veltkamp
Venue: Computer Vision and Image Understanding (2008)

With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in which entries can be represented as graph structures. In our method, the topological structure of a graph as well as that of its subgraphs are represented as vectors whose components correspond to the sorted laplacian eigenvalues of the graph or subgraphs. Given the laplacian spectrum of graph G, we draw from recently developed techniques in the field of spectral integral variation to generate the laplacian spectrum of graph G+e without computing its eigendecomposition, where G+e is a graph obtained by adding edge e to graph G. This process improves the performance of the system for generating the subgraph signatures for 1.8% and 6.5% in datasets of size 420 and 1400, respectively. By doing a nearest neighbor search around the query spectra, similar but not necessarily isomorphic graphs are retrieved. Given a query graph, a voting schema ranks database graphs into an indexing hypothesis to which a final matching process can be applied. The novelties of the proposed method come from the powerful representation of the graph topology and successfully adopting the concept of spectral integral variation in an indexing algorithm. To examine the fitness of the new indexing framework, we have performed a number of experiments using an extensive set of recognition trials in the domain of 2D and 3D object recognition. The experiments, including a comparison with a competing indexing method using two different graph-based object representations, demonstrate both the robustness and efficacy of the overall approach.
TOWARDS OPTIMIZING ENTERTAINMENT IN COMPUTER GAMES
Authors: Georgios N. Yannakakis, John Hallam
Venue: Applied Artificial Intelligence (2007)

Mainly motivated by the current lack of a qualitative and quantitative entertainment formulation of computer games and the procedures to generate it, this article covers the following issues: It presents the features-extracted primarily from the opponent behavior-that make a predator/prey game appealing; provides the qualitative and quantitative means for measuring player entertainment in real time, and introduces a successful methodology for obtaining games of high satisfaction. This methodology is based on online (during play) learning opponents who demonstrate cooperative action. By testing the game against humans, we confirm our hypothesis that the proposed entertainment measure is consistent with the judgment of human players. As far as learning in real time against human players is concerned, results suggest that longer games are required for humans to notice some sort of change in their entertainment.
Multi-player soccer and wireless embedded systems
Authors: Gaetano Borriello, Carl Hartung, Bruce Hemingway, Karl Koscher, Brian Mayton
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Embedded systems are increasingly becoming connected through wireless networking. These devices now form the basis of many of today's consumer products including cell phones and video game controllers. In the "Software for Embedded Systems" class in the Department of Computer Science & Engineering at the University of Washington, we used the design of a multi-player video game as motivation for the principal concepts in wireless embedded systems. Each student in the class designed an accelerometer-based game controller and then, the class as a whole, developed a multi-player video game that allowed 28 players (the number of students in the course) to play simultaneously. In this paper, we first describe the context of the course and its goals followed by the hardware/software platform we used to realize the game controller. We then detail the pedagogical approach we used to collectively design the video game (loosely based on soccer) and conclude with the lessons learned from this group design experience and how we would enhance the project and course in the future.
A New Finite-Field Multiplier Using Redundant Representation
Authors: Ashkan Hosseinzadeh Namin, Huapeng Wu, Majid Ahmadi
Venue: IEEE Transactions on Computers (2008)

A novel finite field multiplier using redundant representation is proposed. The proposed architecture compares favorably to the previously similar proposals. For the class of fields that there exists a type I optimal normal basis, the proposed multiplier has lower complexity and smaller critical path delay in comparison to all the reported normal basis multipliers.
Optimal delay scheduling in networks with arbitrary constraints
Authors: Srikanth Jagabathula, Devavrat Shah
Venue: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2008)

We consider the problem of designing an online scheduling scheme for a multi-hop wireless packet network with arbitrary topology and operating under arbitrary scheduling constraints. The objective is to design a scheme that achieves high throughput and low delay simultaneously. We propose a scheduling scheme that - for networks operating under primary interference constraints - guarantees a per-flow end-to-end packet delay bound of 5dj/(1-ρj), at a factor 5 loss of throughput, where dj is the path length (number of hops) of flow j and ρj is the effective loading along the route of flow j. Clearly, dj is a universal lower bound on end-to-end packet delay for flow j. Thus, our result is essentially optimal. To the best of our knowledge, our result is the first one to show that it is possible to achieve a per-flow end-to-end delay bound of O(# of hops) in a constrained network. Designing such a scheme comprises two related subproblems: Global Scheduling and Local Scheduling. Global Scheduling involves determining the set of links that will be simultaneously active, without violating the scheduling constraints. While local scheduling involves determining the packets that will be transferred across active edges. We design a local scheduling scheme by adapting the Preemptive Last-In-First-Out (PL) scheme, applied for quasi-reversible continuous time networks, to an unconstrained discrete-time network. A global scheduling scheme will be obtained by using stable marriage algorithms to emulate the unconstrained network with the constrained wireless network. Our scheme can be easily extended to a network operating under general scheduling constraints, such as secondary interference constraints, with the same delay bound and a loss of throughput that depends on scheduling constraints through an intriguing "sub-graph covering" property.
A collaborative defense mechanism against SYN flooding attacks in IP networks
Authors: Haidar Safa, Mohamad Chouman, Hassan Artail, Marcel Karam
Venue: Journal of Network and Computer Applications (2008)

SYN flooding exploits the Transmission Control Protocol (TCP) three-way handshake process by sending many connection requests using spoofed source IP addresses to a victim's host. This keeps that host from handling legitimate requests, causing it to populate its backlog queue with forged TCP connections. In this article, we propose a novel defense mechanism that makes use of the edge routers that are associated with the spoofed IP addresses' networks to determine whether the incoming SYN-ACK segment is valid. This is accomplished by maintaining a matching table of the outgoing SYNs and incoming SYN-ACKs and also by using the ARP protocol. If an incoming SYN-ACK segment is not valid, the edge router resets the connection at the victim's host, freeing up an entry in the victim's backlog queue, and enabling it to accept other legitimate incoming connection requests. We also present a communication protocol to encourage collaboration between various networks to protect each other. We evaluated the performance of our proposed approach and studied its impact on the network. Our experimental and simulation results showed the efficiency of our proposed collaborative defense mechanism.