ppxscal/embedding_network huggingface dataset:
Agile framework for globally distributed development environment (the DAD model)
Authors: Rehan Akbar, Muhammad Haris, Majid Naeem
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

Fast pace development and quick iterations has changed the dimensions of web application development. Competition to launch their products first in the market has made clients so demanding. As compared to other traditional process models of Software Engineering Agile model in this context has proved its worth. Face to face communication between client and developers sitting at one place, quick iterations/builds has almost finished the requirement of proper structured documentation. Enormous growth in global IT industry has created offshore clients and development resources for many software companies. Many global clients and organizations are out sourcing their projects for better work on cheap rates with high demands. Agile model has certain limitations when development environment is globally distributed and as in most cases client is offshore. Existing agile principles do not support distributed development environment architecture. This paper focuses on the problems that arise when client is offshore and proposes an agile model for distributed development environment.
Steganalysis of halftone image using inverse halftoning
Authors: Jun Cheng, Alex C. Kot
Venue: Signal Processing (2009)

An inverse halftoning based steganalysis method of halftone images is proposed. In this method, the wavelet statistic features extracted from the reconstructed gray level image through the inverse halftoning of a given halftone image are used in our support vector machines classifier. Different inverse halftoning techniques are investigated including filtering based methods and projection based methods in reconstructing the gray level image. Filtering based and projection based detectors are then proposed and the performance of the steganalysis is compared based on these two detectors.
Host-based traceback; tracking bot and C&C server
Authors: Keisuke Takemori, Masahiko Fujinaga, Toshiya Sayama, Masakatsu Nishigaki
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Recently, attacks involving source IP spoofing have now become critical issues on the Internet. These attacks are considered to be sent from bots that are controlled by command and control (C&C) servers. As many types of unknown bots are released and updated frequently, it becomes difficult to detect bot infected personal computers (PCs) using pattern-based intrusion detection system (IDS) and antivirus software (AV). As bots only affect the PC slightly, users tend to leave them infected. There has been active research into IP traceback systems. However, efforts to determine traceback from victims' PCs to bots and from bots to C&C servers have not yet been achieved. Because control and attack packets are sent asynchronously, it is hard to grasp the relation between bots and C&C servers. In this research, we propose host-based traceback schemes that track (i) from a victim PC to a bot, and (ii) from the bot to a C&C server. In the case of (i), the victim PC notifies its IP address to a traceback coordination center, while another PC downloads the victim IP address to inspect its access records. In the case of (ii), the access records of the bot are collected at the traceback coordination center, which extracts the active IP address considered to be a significant C&C server. We implement a host-based traceback system and evaluate the tracking ability of our model.
Scheduling reentrant jobs on parallel machines with a remote server
Authors: K. Chakhlevitch, C. A. Glass
Venue: Computers and Operations Research (2009)

This paper explores a specific combinatorial problem relating to reentrant jobs on parallel primary machines, with a remote server machine. A middle operation is required by each job on the server before it returns to its primary processing machine. The problem, which is new to the literature, is inspired by the logistics of a semi-automated microbiology laboratory. We establish the NP-hard nature of the problem, and demonstrate various structural properties. A heuristic is developed and tested on randomly generated benchmark data. No alternative heuristics are available in the literature for comparison, but results indicate solutions reliably within 1.5% of optimum. Moreover, tests of our heuristic on real-life data from the microbiology laboratory provide a 20% improvement in throughput relative to current practice.
Word-Length Optimization and Error Analysis of a Multivariate Gaussian Random Number Generator
Authors: Chalermpol Saiprasert, Christos-Savvas Bouganis, George A. Constantinides
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

Monte Carlo simulation is one of the most widely used techniques for computationally intensive simulations in mathematical analysis and modeling. A multivariate Gaussian random number generator is one of the main building blocks of such a system. Field Programmable Gate Arrays (FPGAs) are gaining increased popularity as an alternative means to the traditional general purpose processors targeting the acceleration of the computationally expensive random number generator block. This paper presents a novel approach for mapping a multivariate Gaussian random number generator onto an FPGA by automatically optimizing the computational path with respect to the resource usage. The proposed approach is based on the Eigenvalue decomposition algorithm which decomposes the design into computational paths with different precision requirements. Moreover, an error analysis on the impact of the error due to truncation is performed in order to provide upper bounds of the error inserted into the system. The proposed methodology optimises the usage of the available FPGA resources leading to area efficient designs without any significant penalty on the overall performance. Experimental results reveal that the hardware resource usage on an FPGA is reduced by a factor of two in comparison to current methods.
Comparison of parallel metaheuristics for solving the TSP
Authors: Milena Lazarova, Plamenka Borovska
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The paper compares the efficiency of several metaheuristics for solving the travelling salesman problem. Parallel computational models are suggested for ant colony optimization, simulated annealing and genetic algorithm. The models utilize multiple independent runs on multicomputer platform. The performance parameters and parallelism profiling of the metaheuristics are made based on hybrid (MPI+OpenMP) implementations of the suggested models for solving several instances of TSP from the TSPLIB.
Successful and unsuccessful problem solving approaches of novice programmers
Authors: Brian Hanks, Matt Brandt
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

Learning to program continues to be challenging for many students. This paper reports on problem-solving approaches undertaken by pair programming students. We examine reasons why some approaches lead to success while others lead to failure. We also identify some aspects of the Java language that appear to lead to student misconceptions. Finally, we provide suggestions for educators interested in helping students learn successful approaches and avoid unsuccessful ones.
PIPE2: a tool for the performance evaluation of generalised stochastic Petri Nets
Authors: Nicholas J. Dingle, William J. Knottenbelt, Tamas Suto
Venue: ACM SIGMETRICS Performance Evaluation Review (2009)

This paper presents an overview of Platform-Independent Petri Net Editor 2 (PIPE2 ), an open-source tool that supports the design and analysis of Generalised Stochastic Petri Net (GSPN) models. PIPE2 's extensible design enables developers to add functionality via pluggable analysis modules. It also acts as a front-end for a parallel and distributed performance evaluation environment. With PIPE2, users are able to design and evaluate performance queries expressed in the Performance Tree formalism.
An Orthogonal-Polarization Dual-Wavelength Fiber Laser with Stable Output
Authors: Lin Wang, Fengping Yan, Xiangqiao Mao, Wei Jian, Shuisheng Jian
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

A new orthogonal-polarization dual-wavelength fiber laser by fabricating a uniform FBG and a chirped FBG in a polarization-maintaining erbium-doped fiber (PM-EDF) is proposed and demonstrated. The wavelength space is 0.18nm and the optical signal-to-noise ratio is greater than 50 dB with pump power of 246-mW. Chirped FBG is used to make the reflectivity wavelengths match between two PM-FBGs much easier. Since both EDF and FBGs are polarization-maintaining without splices and the two wavelengths operate with two orthogonal polarizations, the maximum amplitude variation and wavelength shifts for both lasing wavelength with 3-min intervals over a period of six hours were less than 0.2 dB and 0.005 nm, which shows stable dual-wavelength output.
Using Timeline Displays to Improve Medication Reconciliation
Authors: Xinxin Zhu, Sigfried Gold, Albert Lai, George Hripcsak, James J. Cimino
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

Objective: To explore approaches for integrating and visualizing time-oriented medication data in narrative and structured formats and to address related issues on handling temporal abstraction, granularity, and uncertainty. The ultimate goal is to improve medication reconciliation by providing clinicians with more accurate medication information in patient care. Methods: An event taxonomy was generated to capture different combinations of clinical and temporal uncertainties. A prototype of a temporal visualization system was implemented using an open source software package called Timeline. Medications were parsed and mapped to the event taxonomy, and then represented in Timelines. Seventy-five medications from narrative discharge summary reports and seventy-nine medications from structured orders were used as data input for temporal visualization. Five physicians served as domain experts and answered ten proof-of-concept survey questions. Results: Overall positive feedback from experts suggested the potential value of the proposed timeline visualization method. Challenges were also identified, and future work will include reconciliation of medications from various sources based on temporal attributes and medication classification.
Chromium: a stream-processing framework for interactive rendering on clusters
Authors: Greg Humphreys, Mike Houston, Ren Ng, Randall Frank, Sean Ahern, Peter D. Kirchner, James T. Klosowski
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

We describe Chromium, a system for manipulating streams of graphics API commands on clusters of workstations. Chromium's stream filters can be arranged to create sort-first and sort-last parallel graphics architectures that, in many cases, support the same applications while using only commodity graphics accelerators. In addition, these stream filters can be extended programmatically, allowing the user to customize the stream transformations performed by nodes in a cluster. Because our stream processing mechanism is completely general, any cluster-parallel rendering algorithm can be either implemented on top of or embedded in Chromium. In this paper, we give examples of real-world applications that use Chromium to achieve good scalability on clusters of workstations, and describe other potential uses of this stream processing technology. By completely abstracting the underlying graphics architecture, network topology, and API command processing semantics, we allow a variety of applications to run in different environments.
COBOL '74: contributions to structured programming
Authors: Paul Oliver
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Gerald Weinberg, in his book The Psychology of Computer Programming suggests that we cannot really measure the goodness of programs on an absolute scale, and that we generally cannot even measure them on a relative scale. There is indeed evidence that rapid quantification of software quality is not really feasible, because simple formulas can often be misleading and hence not very credible. One could, for example, measure program complexity in terms of the fraction of program statements which are branch statements. Consider however two programs, one with 10 decision points leading to 10 different tasks, each consisting of one instruction, and one with 3 decision points leading to 3 tasks, each consisting of 30 instructions. The "complexity" rating of the first would be 0.50, while that of the second would be 0.09. Surely two such programs would not differ so greatly in complexity.
Specifying Generic Multimedia 3D Visualizations and Temporal Presentations from Database Queries
Authors: Chitta Baral, Graciela Gonzalez
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

The extended version of SQL+D presented here takes multimedia to its ultimate realm: the third dimension, allowing the user to explore the data in a virtual reality environment and display VRML files as data objects. Unlike the limited number of efforts in this area, SQL+D goes beyond constructing 3D bar charts. It allows truly interactive environments dynamically specified by the user in a query and constructed from data extracted from the database.Multimedia presentations are usually specified for a fixed set of elements. When dealing with database queries, the specific elements are unknown until the answer set is obtained. We present here the syntax of an improved version of SQL+D that allows a user to specify complex generic temporal presentations within the query itself. We have implemented most of our proposed extension .
An energy-efficient node-scheduling scheme for wireless sensor networks based on minimum dominating sets
Authors: Babak Pazand, Amitava Datta
Venue: International Journal of Network Management (2009)

One of the major requirements for new wireless sensor networks is to extend the lifetime of the network. Node-scheduling techniques have been used extensively for this purpose. Some existing approaches rely mainly on location information through global positioning system (GPS) devices for designing efficient scheduling strategies. However, integration of GPS devices with sensor nodes is expensive and increases the cost of deployment dramatically. In this paper we present a location-free solution for node scheduling. Our scheme is based on a graph theoretical approach using minimum dominating sets. We propose a heuristic to extract a collection of dominating sets. Each set consists of a group of working nodes which ensures a high level of network coverage. At each round, one set is responsible for covering the sensor field while the nodes in other sets are in sleep mode. We evaluate our solution through simulations and discuss our future research directions.
Some comments on &ldquo;A Proposal for a Dynamic h-Type Index&rdquo; by Rousseau and Ye
Authors: Quentin L. Burrell
Venue: Journal of the American Society for Information Science and Technology (2009)

Caution is urged over the adoption of dynamic h-type indexes as advocated by Rousseau and Ye (2008). It is shown that the dynamics are critically dependent upon model assumptions and that practical interpretation might therefore be problematic. However, interesting questions regarding the interrelations between various h-type indexes are raised. &copy; 2009 Wiley Periodicals, Inc.
Dimensional dual hyperovals with doubly transitive automorphism groups
Authors: Satoshi Yoshiara
Venue: European Journal of Combinatorics (2009)

It is shown that if a d-dimensional dual hyperoval S over GF(q) has a doubly transitive automorphism group G, then either q=2 and G is of affine type, or q=4, d=2 and G@?M"2"2 or M"2"2.2. This improves the results in [C. Huybrechts, A. Pasini, Flag-transitive extensions of dual affine spaces, Contrib. Algebra Geom. 40 (1999) 503-532] in the following sense: q is shown to be even, and the shape of G is strongly restricted, including the case q=2.
A New Hierarchical Data Cache Architecture for iSCSI Storage Server
Authors: Jun Wang, Xiaoyu Yao, Christopher Mitchell, Peng Gu
Venue: IEEE Transactions on Computers (2009)

With the emergence of data-intensive applications, recent years have seen a fast-growing volume of I/O traffic propagated through the local I/O interconnect bus. This raises up a question for storage servers on how to resolve such a potential bottleneck. In this paper, we present a hierarchical Data Cache Architecture called DCA to effectively slash local interconnect traffic and thus boost the storage server performance. A popular iSCSI storage server architecture is chosen as an example. DCA is composed of a read cache in NIC called NIC cache and a read/write unified cache in host memory called Helper cache. The NIC cache services most portions of read requests without fetching data via the PCI bus, while the Helper cache 1) supplies some portions of read requests per partial NIC cache hit, 2) directs cache placement for NIC cache, and 3) absorbs most transient writes locally. We develop a novel State-Locality-Aware cache Placement algorithm called SLAP to improve the NIC cache hit ratio for mixed read and write workloads. To demonstrate the effectiveness of DCA, we develop a DCA prototype system and evaluate it with an open source iSCSI implementation under representative storage server workloads. Experimental results showed that DCA can boost iSCSI storage server throughput by up to 121 percent and reduce the PCI traffic by up to 74 percent compared with an iSCSI target without DCA.
Church's Thesis After 70 Years, illustrated edition edition
Authors: Adam Olszewski, Jan Wolenski, Robert Janusz
Venue: Ontos Mathematical Logic (2007)

"Church's Thesis" (CT) was first published by Alonzo Church in 1935. CT is a proposition that identifies two notions: an intuitive notion of a effectively computable function defined in natural numbers with the notion of a recursive function. Despite of the many efforts of prominent scientists, "Church's Thesis" has never been falsified. There exists a vast literature concerning the thesis. The aim of the book is to provide one volume summary of the state of research on "Church's Thesis". These include the following: different formulations of CT; CT and intuitionism; CT and intentional mathematics; CT and physics; the epistemic status of CT; CT and philosophy of mind; provability of CT; and CT and functional programming.
WISDOM: security-aware fibres
Authors: Elias Athanasopoulos, Antonis Krithinakis, Georgios Kopidakis, Graeme Maxwell, Alistair Poustie, Bob Manning, Rod Webb, Martin Koyabe, Carla Di Cairano-Gilfedder
Venue: Proceedings of the Second European Workshop on System Security (2009)

The network is becoming faster day by day. High-speed links, of many Gbps, are considered as commodity technology empowering the Internet. On the other hand, Moore's law still applies to current processing power. It needs about 18 months for CPUs to double the number of their transistors. A very fast network composed by not as fast processors is unable to perform basic operations needed in the security field, like firewalling and intrusion detection. In this paper, we propose a novel system, which promotes security operations in the optical domain. We describe all hardware components - optical and digital - and the software, which renders the system functional. We outline application scenarios in which a hybrid architecture of optical and digital parts, like the one we propose in this paper, can offer significant benefit to the network from a security perspective.
StegErmelc: A Novel DCT-Based Steganographic Method Using Three Strategies
Authors: KokSheik Wong, Kiyoshi Tanaka
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper proposes a DCT-based steganographic method named StegErmelc in the JPEG domain. Three strategies are proposed, namely (i) edge-like block selection, (ii) recursive matrix encoding, and (iii) largest coefficient serving, to form a novel steganographic method for achieving scalable carrier capacity, low detectability by universal blind steganalyzer, and high image quality, simultaneously. For a given message length, StegErmelc flexibly scales its carrier capacity to accommodate the message while trading off with stego detectability. At full capacity, StegErmelc has comparable carrier capacity relative to the existing methods. When embedding the same amount of information, StegErmelc remarkably reduces the stego detection rate to about 0.3–0.5 lower than that of the existing methods considered, and consequently StegErmelc can withstand blind steganalyzer when embedding up to 0.10 bpc. Under the same condition, StegErmelc produces stego image with quality higher than that of the existing methods considered. Graphical comparison with three additional evaluation metrics is also presented to show the relative performance of StegErmelc with respect to the existing methods considered.
Usable Multimedia Applications
Authors: Maria Francesca Costabile
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Usable Multimedia Applications is the title of the special session at ICMCS'99 that covers issues related to the development of usable multimedia applications that can facilitate users' comprehension and interaction with the information being presented. Evaluation problems are addressed, with a special focus on usability, which represents a significant aspect of the overall quality of any multimedia application. Models, principles, and guidelines of good design are discussed. The role of design cannot be neglected: the quality of the development process and of the resulting products are largely affected by the quality of design. In this sense, design and evaluation are strongly interrelated.
A fuzzy logics clustering approach to computing human attention allocation using eyegaze movement cue
Authors: Y. Lin, W. J. Zhang, C. Wu, G. Yang, J. Dy
Venue: International Journal of Human-Computer Studies (2009)

Human's attention is an important element in human-machine interface design due to a close relationship between operator's attention and operator's work performance. However, understanding of operator's attention allocation while he or she is performing a task remains a challenging task because attention is generally unobservable, immeasurable, and uncertain. In our previous study, we demonstrated the effectiveness of using operator's eye movement information to understand attention allocation, which has made attention observable. The present paper describes our study which addressed immeasurability and uncertainty of attention. Specifically, we used eye fixation's duration to indicate operator's attention and developed a new computational model for the attention and its allocation using fuzzy logics clustering techniques. Along with the development of this model, we also developed an experiment to verify the effectiveness of the model. The result of the experiment shows that the model is promising.
IBM 3850: mass storage system
Authors: Clayton Johnson
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

IBM's 3850, a hierarchical storage system, provides random access to stored data with capacity ranging from 35 X 109 to 472 X 109 bytes. The hierarchical architecture achieves access times varying from Direct Access Storage Device speeds to that of the Mass Storage Facility which can be as low as 10 seconds. The architecture of the Mass Storage System is examined to demonstrate its functional and performance capability.