ppxscal/embedding_network huggingface dataset:
Steganalysis of JPEG images: an improved approach for breaking the F5 algorithm
Authors: Hatim A. Aboalsamh, Hassan I. Mathkour, Mona F. M. Mursi, Ghazy M. R. Assassa
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

People often transmit digital images over the internet and JPEG is one of the most common used formats. Steganography is the art and science of hiding communication; the information hiding process thus uses an image as a cover medium to embed a hidden message. Steganalysis is the inverse process of trying to identify the existence of hidden message in a cover image. In this paper, we present an enhancement to the steganalysis algorithm that successfully attacks F5 steganographic algorithm. The key idea is related to the selection of an "optimal" value of β (the probability that a non-zero AC coefficient will be modified) for the image under consideration. Rather than averaging the values of β for 64 shifting steps worked on an image, an optimal β is determined that corresponds to the shift having minimal distance E from the double compression removal step. Numerical experiments were carried out to validate the proposed enhanced algorithm and compare it against the original one. Both algorithms were tested and compared using two sets of test images. The first set uses reference test data of 20 grayscale images [1], and the second uses 432 images created by manipulating 12 images for various image parameters: two sizes (300×400 and 150×2000), six JPEG old quality factors (50, 60, 70, 80, 90, 100), and 3 message lengths (0, 1kB, 2 kB). The results suggest that the original algorithm may be used as a classifier, since it shows a good detection performance of both clean and stego test images; whereas, the proposed enhanced algorithm may be used as an estimator for the true message length for those images that have been classified by original algorithm as stego images.
On the role and effectiveness of pop quizzes in CS1
Authors: Vincent A. Cicirello
Venue: ACM SIGCSE Bulletin (2009)

In this paper, we explore the potential important role that unannounced (or "pop") quizzes can play in CS-1. "Pop" quizzes generate continual feedback to both the student and the instructor of the course. They also encourage students to avoid missing class unless necessary. We present the results of a three year study on the effectiveness of "pop" quizzes in CS-1. Our results demonstrate that students who experience "pop" quizzes in CS-1 score higher on exams than do their counterparts who did not experience "pop" quizzes. This appears especially true for upperclassmen, particularly for juniors. The use of "pop" quizzes in CS-1 also improves performance on programming assignments for juniors. CS/IS majors and Math majors both receive a greater benefit from "pop" quizzes than do other non-majors.
Information Leakage as a Model for Quality of Anonymity Networks
Authors: Ye Zhu, Riccardo Bettati
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

Measures for anonymity in systems must be on one hand simple and concise, and on the other hand reflect the realities of real systems. Such systems are heterogeneous, as are the ways they are used, the deployed anonymity measures, and finally the possible attack methods. Implementation quality and topologies of the anonymity measures must be considered as well. We therefore propose a new measure for the anonymity degree, that takes into account these various. We model the effectiveness of single mixes or of mix networks in terms of information leakage, and we measure it in terms of covert channel capacity. The relationship between the anonymity degree and information leakage is described, and an example is shown.
Applying GIS to develop a web-based spatial-person-temporal history educational system
Authors: Jia-Jiunn Lo, Chuen-Jung Chang, Hsiao-Han Tu, Shiou-Wen Yeh
Venue: Computers Education (2009)

Developing interactive history learning materials to facilitate historical thinking is one of the challenges in history teaching and learning. This study developed a web-based history educational system, which has used the acronym HES-SPATO (history educational system based on SPATO), to increase the understandability of history learning materials. SPATO (spatial, person, action/attribute, and temporal object) was designed to integrate the indispensable elements of history events such as space, person, action/attribute, and time. HES-SPATO also applied temporal logic to reason the temporal relationships between history events. Furthermore, it employed the GIS concept of information layers to develop the student interface. The findings of the experiments indicated that the use of HES-SPATO was effective in enhancing students' history learning. The participants also showed positive attitudes toward the HES-SPATO system in terms of the perceived ease of use, perceived usefulness, attitude to use, intention to use, recall of web sites, and perceived usefulness of assistant tools. Although many functionalities have been added to the HES-SPATO system, there was no significant difference in system efficiency between HES-SPATO and the comparative system. These experimental results also guide the direction of future research.
Agent-based modeling and simulation: ABMS examples
Authors: Charles M. Macal, Michael J. North
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Agent-based modeling and simulation (ABMS) is a new approach to modeling systems comprised of autonomous, interacting agents. ABMS promises to have far-reaching effects on the way that businesses use computers to support decision-making and researchers use electronic laboratories to support their research. Some have gone so far as to contend that ABMS "is a third way of doing science," in addition to traditional deductive and inductive reasoning (Axelrod 1997). Computational advances have made possible a growing number of agent-based models across a variety of application domains. Applications range from modeling agent behavior in the stock market, supply chains, and consumer markets, to predicting the spread of epidemics, the threat of bio-warfare, and the factors responsible for the fall of ancient civilizations. This tutorial describes the theoretical and practical foundations of ABMS, identifies toolkits and methods for developing agent models, and illustrates the development of a simple agent-based model.
A GridFTP Overlay Network Service
Authors: Philip Rizk, Cameron Kiddle, Rob Simmonds
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

TCP is widely deployed and is used by the current implementation of GridFTP for data transfers within grid environments. Due to TCP dynamics, throughput of data transfers can be much lower than the available bandwidth in wide area networks. Splitting a TCP connection into two or more segments has been shown to improve throughput in this setting. This paper presents a set of components to enable easy deployment of overlay networks that make use of split-TCP connections to improve GridFTP transfer performance. The components include an extension to the Globus Toolkit v4 GridFTP server that supports split TCP connections, a service to estimate bulk transfer capacity and a service to determine if and where to split a connection. Results demonstrate significant performance improvement despite using very intermittent, passive throughput observations to determine the routing of the split connections.
Simulation and Analysis of Weighted Fair Queuing Algorithms in OPNET
Authors: Zirong Guo, Huaxin Zeng
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Various network applications have different quality of service requirements. The capability to provide flow based QoS support has become very important for the design of modern switches and routers. GPS is an idealized fluid model that can provide flow based performance guarantees, various packet approximation algorithms of GPS were proposed in literatures. These packet fair queueing algorithms can provide the desired performance, and they are often regarded as reference for research on routers and switches. In this paper, we model and simulate OQ switches using various fair queueing algorithms in OPNET, and evaluate their delay and fairness performance in single switch node and multiple switch node case.
PlayByPlay: collaborative web browsing for desktop and mobile devices
Authors: Heather Wiltse, Jeffrey Nichols
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Collaborative web browsing tasks occur frequently, such as one user showing another how to use a web site, several users working together on a search task, or even one user sending an interesting link to another user. Unfortunately, tools for browsing the web are commonly designed for a single user. PlayByPlay is a general purpose web collaboration tool that uses the communication model of instant messaging to support a variety of collaborative browsing tasks. PlayByPlay also supports collaborative browsing between mobile and desktop users, which we believe is useful for on-the-go scenarios. We conducted user studies of the desktop and mobile versions of PlayByPlay and found the system to be usable and effective.
A Comparison of Hardware Prefetching Techniques for Multimedia Benchmarks
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Data prefetching is a well known technique for improving cache performance. While several studies have examined prefetch strategies for scientific and commercial applications, no published work has studied the special memory requirements of multimedia applications. This paper presents data for three types of hardware prefetching schemes: stream buffers, stride prediction tables, and a hybrid combination of the two, the stream cache. Use of the stride prediction table is shown to eliminate up to 90% of the misses that would otherwise be incurred in a moderate or large sized cache with no prefetching hardware. The stream cache, proposed for the first time in this paper, has the potential to cut execution times by half with the addition of a relatively small amount of additional hardware. 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
The Flaws of Nature
Authors: Stan Kelly-Bootle
Venue: Queue (2009)

And the perils of indecision. The latest musings of Stan Kelly-Bootle.
A web-based model for developing: A mold base design system
Authors: Jiung-Ming Huang, Yuang-Tsan Jou, Liu-Cun Zhang, Shen-Tsu Wang, Cheng-Xiang Huang
Venue: Expert Systems with Applications: An International Journal (2009)

In the age of networking and digitalization, operations of dealing and production process can be accelerated through a World-Wide-Web collaboration, integrating designs and manufacturing management of products and molds. Molding is the most commonly used method of production for modern products, while a mold manufacturer today should connect firmly, through the supply chain system, to all the points, so as to increase service performance for the customers. A web-based sharing system of mold base design and ordering is considerable, being built whereby a customer will get the design with price information quickly and the order shipped more conveniently. This paper provides to the plastic mold industry a developing process of a web-based parametric design system of mold bases. First of all, contents of the related information and data are analyzed and expanded by the method of IDEF0, and are finely structured into design procedure and all sorts of database. A three-tiered mold base design model with distributed database is presented to reduce the expense of software building and the renewal of the system database. The system interface uses maps plus parametric and feature-based database to make the processes of design smoother, and also edition and viewing of the results.
A Novel Original Streaming Video Wavelet Domain Watermarking Algorithm in Copyright Protection
Authors: Xinghao Jiang, Tanfeng Sun, Jianhua Li
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In the paper, it is suggested a novel algorithm of original streaming video of wavelet domain watermarking with Independent Component Analysis (ICA) using in signal blind detection. In this algorithm, it is made up regulate model of wavelet low frequency coefficient difference in video background picked-up by ICA and quantization modulate the wavelet low frequency coefficient differences of 8 pixel blocks in one MB. This algorithm has a good stability to some common video attacks.
Program debugging using COBOL '74
Authors: George N. Baird
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The testing and checkout of production software often consumes upwards of 50 percent of the effort that goes into the development of the system. The absence in most programming languages of language elements specifically defined for debugging programs contributes to the time and effort involved in the checkout of systems due to programmers having to use various techniques to improvise debugging code. This was especially true of the 1968 COBOL Standard in that there were no language elements dedicated to the debugging and proving correctness of programs.
Longitudinal study of people learning to use continuous voice-based cursor control
Authors: Susumu Harada, Jacob O. Wobbrock, Jonathan Malkin, Jeff A. Bilmes, James A. Landay
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We conducted a 2.5 week longitudinal study with five motor impaired (MI) and four non-impaired (NMI) participants, in which they learned to use the Vocal Joystick, a voice-based user interface control system. We found that the participants were able to learn the mapping between the vowel sounds and directions used by the Vocal Joystick, and showed marked improvement in their target acquisition performance. At the end of the ten session period, the NMI group reached the same level of performance as the previously measured "expert" Vocal Joystick performance, and the MI group was able to reach 70% of that level. Two of the MI participants were also able to approach the performance of their preferred device, a touchpad. We report on a number of issues that can inform the development of further enhancements in the realm of voice-driven computer control.
Prefetching based on web usage mining
Authors: Daby M. Sow, David P. Olshefski, Mandis Beigi, Guruduth Banavar
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

This paper introduces a new technique for prefetching web content by learning the access patterns of individual users. The prediction scheme for prefetching is based on a learning algorithm, called Fuzzy-LZ, which mines the history of user access and identifies patterns of recurring accesses. This algorithm is evaluated analytically via a metric called learnability and validated experimentally by correlating learnability with prediction accuracy. A web prefetching system that incorporates Fuzzy-LZ is described and evaluated. Our experiments demonstrate that Fuzzy-LZ prefetching provides a gain of 41.5 % in cache hit rate over pure caching. This gain is highest for those users who are neither highly predictable nor highly random, which turns out to be the vast majority of users in our workload. The overhead of our prefetching technique for a typical user is 2.4 prefetched pages per user request.
Using Agent-Based Simulation of Human Behavior to Reduce Evacuation Time
Authors: Arief Rahman, Ahmad Kamil Mahmood, Etienne Schneider
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

Human factors play a significant part in the time taken to evacuate due to an emergency. An agent-based simulation, using the Prometheus methodology (SEEP 1.5), has been developed to study the complex behavior of human (the `agents') in high-rise building evacuations. In the case of hostel evacuations, simulation results show that pre-evacuation phase takes 60.4% of Total Evacuation Time (TET). The movement phase (including queuing time) only takes 39.6% of TET. From sensitivity analysis, it can be shown that a reduction in TET by 41.2% can be achieved by improving the recognition phase. Emergency exit signs have been used as smart agents. Modified Ant Colony Optimization (ACO) was used to determine the feasibility of the evacuation routes. Both wayfinding methods, the `familiarity of environment', which is the most natural method, and the ACO method have been simulated and comparisons were made. In scenario 1, where there were no obstacles, both methods achieved the same TET. However, in scenario 2, where an obstacle was present, the TET for the ACO wayfinding method was 21.6% shorter than the one for the `familiarity' wayfinding method.
Mining probabilistic automata: a statistical view of sequential pattern mining
Authors: Stéphanie Jacquemont, François Jacquenet, Marc Sebban
Venue: Machine Learning (2009)

During the past decade, sequential pattern mining has been the core of numerous research efforts. It is now possible to efficiently extract knowledge of users' behavior from a huge set of sequences collected over time. This has applications in various domains such as purchases in supermarkets, Web site visits, etc. However, sequence mining algorithms do little to control the risks of extracting false discoveries or overlooking true knowledge. In this paper, the theoretical conditions to achieve a relevant sequence mining process are examined. Then, the article offers a statistical view of sequence mining which has the following advantages: First, it uses a compact and generalized representation of the original sequences in the form of a probabilistic automaton. Second, it integrates statistical constraints to guarantee the extraction of significant patterns. Finally, it provides an interesting solution in a privacy preserving context in order to respect individuals' information. An application in car flow modeling is presented, showing the ability of our algorithm (acsm) to discover frequent routes without any private information. Comparisons with a classical sequence mining algorithm (spam) are made, showing the effectiveness of our approach.
Extracting camera-control requirements and camera movement generation in a 3D virtual environment
Authors: Hirofumi Hamazaki, Shinya Kitaoka, Maya Ozaki, Yoshifumi Kitamura, Robert W. Lindeman, Fumio Kishino
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

This paper proposes a new method to generate smooth camera movement that is collision-free in a three-dimensional virtual environment. It generates a set of cells based on cell decomposition using a loose octree in order not to intersect with polygons of the environment. The method defines a camera movement space (also known as Configuration Space) which is a set of cells in the virtual environment. In order to generate collision-free camera movement, the method holds a path as a graph structure which is based on the adjacency relationship of the cells, and makes the camera move on the graph. Furthermore, by using a potential function for finding out the force that aims the camera at the subject and a penalty function for finding out the force that restrains the camera on the graph when the camera moves on the graph, we generate smooth camera movement that captures the subject while avoiding obstacles. Several results in static and dynamic environments are presented and discussed.
On the Classification of Some Three Dimensional Quaternary Optimal Self-orthogonal Codes
Authors: Xuejun Zhao, Yingjie Lei, Ruihu Li
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The classification of quaternary [21s+t,3,d] codes with d≥16s and without zero coordinates is reduced to the classification of quaternary [21c(3,s,t)+t,k,d] code for s≥1 and 0≤t≤20, where c(3,s,t)≤ min{s, 3t} is a function of 3, s, and t. Quaternary optimal Hermitian self-orthogonal codes are characterized by systems of linear equations. Based on these two results, the complete classification of [21s+t,3] optimal self-orthogonal codes with s≥1 and t∈{9,11} is obtained, and the generator matrices and weight polynomials of these 3-dimensional optimal self-orthogonal codes are also given. All these codes meeting the Griesmer bound.
Data Mining Spontaneous Facial Behavior with Automatic Expression Coding
Authors: Marian Bartlett, Gwen Littlewort, Esra Vural, Kang Lee, Mujdat Cetin, Aytul Ercil, Javier Movellan
Venue: Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction: COST Action 2102 International Conference, Patras, Greece, October 29-31, 2007. Revised Papers (2008)

The computer vision field has advanced to the point that we are now able to begin to apply automatic facial expression recognition systems to important research questions in behavioral science. The machine perception lab at UC San Diego has developed a system based on machine learning for fully automated detection of 30 actions from the facial action coding system (FACS). The system, called Computer Expression Recognition Toolbox (CERT), operates in real-time and is robust to the video conditions in real applications. This paper describes two experiments which are the first applications of this system to analyzing spontaneous human behavior: Automated discrimination of posed from genuine expressions of pain, and automated detection of driver drowsiness. The analysis revealed information about facial behavior during these conditions that were previously unknown, including the coupling of movements. Automated classifiers were able to differentiate real from fake pain significantly better than naïve human subjects, and to detect critical drowsiness above 98% accuracy. Issues for application of machine learning systems to facial expression analysis are discussed.
A secure and delay-efficient scheme for NetLMM
Authors: Hayoung Oh, Kijoon Chae
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Network-based Localized Mobility Management (NetLMM) is a fairly recent mobility scheme in IETF because the Mobile Node (MN) does not need to have a mobility stack. However, almost previous mobility solutions for the enhanced NetLMM assume good channel quality for direct link between Access Point (AP) and Mobile Node (MN) and secure under attack. However, in real wireless communications, the channel quality of the direct link between AP and MN can be bad and cause a long handover delay. In fact packets between AP and MN can be delivered faster through a relay coding node. In special, network coding has been shown to improve the throughputs of wireless networks and reduce the communication delay. Therefore, in this paper, we propose a Secure and Channel-aware Relay Coding (SCRC) scheme for Network-based Localized Mobility Management (LetLMM). In the proposed scheme, both AP and MN select the proper relay coding node through the RTS-CTS negotiation and encrypt the message using Modified Cryptographic Generated Address (MCGA) to support secure and delay-efficient communication in NetLMM.