ppxscal/embedding_network huggingface dataset:
Minimum Cuts of Simple Graphs in Almost Always Linear Time
Authors: Michael Brinkmeier
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

In this paper we prove, that the minimum cut algorithm presented previously by the author (Brinkmeier 07), requires only linear time with high probability, if the input graph if chosen randomly from the graphs with constant expected degree. In fact a more general lower bound for the probability of a low runtime depending on several parameters is given.
Cost-Optimisation of Analytical Software Quality Assurance: Models, Data, Case Studies
Authors: Stefan Wagner
Venue:  (2008)

Analytical software quality assurance (SQA) constitutes with about 50% a significant part of the total development costs of a software system. Hence, it is a promising areafor cost-optimisation. Various defect-detection techniques can be used to improve thequality of software. The main question is how to use those different techniques ina cost-optimal way. However, the costs and benefits of SQA and the interrelationshipsof the influencing factors are still not completely understood.This book presents an analytical and stochastic model of the economics of analytical SQA. The model can be used to analyse different techniques theoretically and to optimisethe SQA in a company using historical project data.Case studies were done in various domains and evaluating different techniques in different phases. All these case studies provided valuable feedback on the model and also contributed to the body ofknowledge on the efficiency of the techniques. The book is aimed at researchers and practitioners in software quality management.
Security in the browser
Authors: Thomas Wadlow Vlad Gorelik
Venue: Communications of the ACM (2009)

What can be done to make Web browsers secure while preserving their usability?
Refining the MATILDA multimedia authoring framework with a visual formalism
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: The MATILDA multimedia authoring system has been developed to address issues related to authoring process and information management and representation. The paper presents our initial application of the structured graph visual formalism to the MATILDA data models. This has resulted in the introduction of a new group of automatically derivable links in the data models, and highlights some data model distinctions which we believe should be captured. We also discuss the possible use of the scalable editing and browsing operations that are part of the formalism.
Efficient and practical audio-visual rendering for games using crossmodal perception
Authors: David Grelaud, Nicolas Bonneel, Michael Wimmer, Manuel Asselot, George Drettakis
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

Interactive applications such as computer games, are inherently audio visual, requiring high-quality rendering of complex 3D audio soundscapes and graphics environments. A frequent source of audio events is impact sounds, typically generated with physics engines. In this paper, we first present an optimization allowing efficient usage of impact sounds in a unified audio rendering pipeline, also including prerecorded sounds. We also exploit a recent result on audio-visual crossmodal perception to introduce a new level-of-detail selection algorithm, which jointly chooses the quality level of audio and graphics rendering. We have integrated these two techniques as a comprehensive crossmodal audio-visual rendering pipeline in a home-grown game engine, thus demonstrating the potential utility of our approach.
A Genetic Algorithm for Makespan Minimization in a No-wait Flow Shop Problem with Two Batching Machines
Authors: F. Jolai, H. Kor, S. M. Hatefi, H. Iranmanesh
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

In this paper we consider a scheduling problem where a set of jobs are simultaneously available for processing in a no-wait two-machine flowshop. All jobs are processed on both machines in batches. Batching machines can process several tasks per batch so that all tasks of the same batch start and complete together. The batch processing time for the first machine is equal to the maximal processing time of the tasks in this batch, and for the second machine is equal to the sum of the processing times of the tasks in this batch. The objective is to minimize the makespan, i.e. the maximum completion time of the jobs with using genetic algorithm and finding the bestscheduling jobs.
Personality and motivations associated with Facebook use
Authors: Craig Ross, Emily S. Orr, Mia Sisic, Jaime M. Arseneault, Mary G. Simmering, R. Robert Orr
Venue: Computers in Human Behavior (2009)

Facebook is quickly becoming one of the most popular tools for social communication. However, Facebook is somewhat different from other Social Networking Sites as it demonstrates an offline-to-online trend; that is, the majority of Facebook Friends are met offline and then added later. The present research investigated how the Five-Factor Model of personality relates to Facebook use. Despite some expected trends regarding Extraversion and Openness to Experience, results indicated that personality factors were not as influential as previous literature would suggest. The results also indicated that a motivation to communicate was influential in terms of Facebook use. It is suggested that different motivations may be influential in the decision to use tools such as Facebook, especially when individual functions of Facebook are being considered.
The challenges of correlating silicon and models in high variability CMOS processes
Authors: Robert C. Aitken
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

This talk discusses one of the key challenges of post-silicon validation: namely, the difficulty inherent in correlating observed behavior with modeled behavior. Validation must account for a large number of sources of inherent variability in the silicon, ranging from those inherent in the device and wire models themselves through approximations made in library modeling, extraction, tool algorithms and so on. The problem is further complicated by defects and systematic errors that can be present in early silicon. In addition, environmental factors such as temperature and on-chip power supply must be understood, and lastly variation in the measurement equipment must also be correctly accounted for. Examples are given for validating standard cell and memory based designs as well as a general methodology that can be used to enable chip bring-up.
Probing Human Error as Causal Factor in Incidents with Major Accident Potential
Authors: Andreas Lumbe Aas
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

Existing literature suggests that human error indirectly linked to the majority of industrial incidents and accidents. The increasing use of computers and software in safety-critical systems makes systems more integrated and dependent and this can increase the risk if barrier integrity is reduced. This paper demonstrate show the Human Factors Assessment and Classification System (HFACS) can be applied to analyze incidents with major accident potential. One report from a Norwegian offshore Oil & Gas incident with major accident potential was analyzed to classify the causal factors for the purpose of making a relative comparison of these factors. The results revealed that failures on the organizational level were the most prevailing, representing almost three quarters of all causal factors, while unsafe acts represented fourteen percent. Thus, organizational factors appear essential in risk management and failures on the organizational level require more attention to mitigate risks in the future.
Research on Blind Equalization Algorithm of Modified RLS Based on Canonical Correlation Analysis
Authors: Liu Shunlan, Zhu Fu, Hu Jianhong
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, a new blind equalization algorithm suitable for single-input multiple-output (SIMO) systems is introduced based on recursive least squares algorithm and canonical correlation analysis (CCA-RLS), and a modified recursive least squares algorithm with variable forgetting factor based on canonical correlation analysis (CCA-MRLS) is proposed. Combining CCA with MRLS, CCA-MRLS algorithm is applied to SIMO systems. Unlike other approaches, the CCA–RLS obtains simultaneously the optimal equalizers as well as the best combination of their outputs. The simulation results demonstrate that the proposed CCA-MRLS algorithm can offer good convergence characteristics and has a faster convergence speed, lower residual inter-symbol interference than CCA-RLS after convergence.
Video retrieval based on object discovery
Authors: David Liu, Tsuhan Chen
Venue: Computer Vision and Image Understanding (2009)

State-of-the-art video retrieval methods use global image statistics to provide low level descriptors or use object recognizers to provide high level features. Using global image statistics can be hindered by lack of explicitly characterizing the object of interest hence prone to retrieving irrelevant results, while using object recognizers can suffer from having to train a large number of object recognizers for different types of objects. We present a novel framework for content-based video retrieval. We use an unsupervised learning method to automatically discover and locate the object of interest in a video clip. This unsupervised learning algorithm alleviates the need for training a large number of object recognizers. Regional image characteristics are extracted from the object of interest to form a set of descriptors for each video. A novel ensemble-based matching algorithm compares the similarity between two videos based on the set of descriptors each video contains. Videos containing large pose, size, and lighting variations are used to validate our approach.
Interview with George P. Landow
Authors: Claus Atzenbeck
Venue: Issue Spring (March 2009) (2009)

George P. Landow is Professor of English and the History of Art, Brown University and Founder, Editor-in-chief, and Webmaster of The Victorian Web. His books on hypertext and digital culture include Hypermedia and Literary Studies (MIT, 1991), and The Digital Word: Text-Based Computing in the Humanities (MIT, 1993) both of which he edited with Paul Delany, and Hypertext: The Convergence of Contemporary Critical Theory and Technology (Hopkins UP, 1992), which has appeared in various European and Asian languages and as Hypertext in Hypertext (Hopkins UP, 1994), a greatly expanded electronic version with original texts by Derrida, reviews, student interventions, and works by other authors. In 1997, he published a much-expanded, completely revised version as Hypertext 2.0, and Hypertext 3.0: New Media and Critical Theory in an Era of Globalization appeared in January 2006. He has also edited Hyper/Text/Theory. (Hopkins UP, 1994). More information can be found at http://www.victorianweb.org/cv/gplbio.html.
Adaptive performance support for fault diagnosis
Authors: Ammar M. Huneiti
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

This paper introduces a strategy, a user model, and a methodology for utilising adaptive hypermedia in performance support domain and specifically for fault diagnosis. This utilisation is implemented by employing task-specific and user-centred hypermedia which allows supporting content to be synchronized with the diagnostic expert system inference process. A stereotype user model is suggested in order to represent the knowledge of the user of the performed tasks. This stereotype user model is used for the adaptive retrieval of finely separated and semantically classified information elements. The technique that is proposed in this paper is demonstrated through a prototype adaptive expert system for locating and correcting braking system faults in a forklift truck.
A computer-aided design tool for the analysis of electrical-connector transmission lines
Authors: Wei-chen Lee, Sedig S. Agili
Venue: International Journal of Computer Applications in Technology (2009)

This paper presents the calculation of the differential impedance, the velocity of propagation, and the worst-case near-end crosstalk coefficient of the cross sections of transmission lines by using a computer-aided design tool. The cross sections embedded in this tool are commonly seen in electrical connector design, but not in printed circuit board design due to their different fabrication processes. Several designs are studied and the important results are presented. Some charts that illustrate the relationship between the electrical parameters and the geometries of the transmission lines are shown, which allow the designers to perform a quick initial design.
A Combined Template-Based and Case-Based Metadata Extraction for Heterogeneous Thai Documents
Authors: Krisda Khankasikam, Nopasit Chakpitak, Thana Udomsripaiboon
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Nowadays, a number of universities, laboratories, government agencies and companies that placing theirs documents online and making them searchable are increasing because the Internet infrastructure for global data access is fully functional. However, a large number of organizations have documents that lack metadata. The lack of metadata breaks off not only the discovery and dissemination of these documents over the Internet, but also their connectivity with other documents. Unfortunately, manual metadata extraction is expensive and time-consuming for a large document, and most existing automated metadata extraction approaches have focused on specific domains and homogeneous documents. In this paper, we propose a combined cased-based and template-based metadata extraction approach to solve these issues. The key idea of solving the heterogeneity is to classify documents into equivalent groups so that each document group contains similar documents only. Next, for each document group we have a template of previous case that contains a process to extract metadata from documents in the group.
Diffusion-driven congestion reduction for substrate topological routing
Authors: Shenghua Liu, Guoqiang Chen, Tom Tong Jing, Lei He, Robi Dutta, Xian-Long Hong
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

Off-chip substrate routing for high density packages is challenging, and the existing substrate routing algorithms often result in a large number of unrouted nets that have to be routed manually. This paper develops an effective yet efficient diffusion-driven method D-Router to improve routability by a simulated diffusion process based on the duality between congestion and concentration. Compared with a recently published A*-based algorithm used in a state of the art commercial tool and with similar routability and runtime as the negotiation based routing, D-Router reduces the number of unrouted nets by 4.6x with up to 94x runtime reduction.
Research of Model about Leaguer Selecting of Virtual Enterprise Based on Project Logistics
Authors: Bo Jiang, Kelin Xu, Yongchang Qian
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Aim at need of project logistics in practice, a parameter evaluating system about leaguer of virtual enterprise is presented, and then the BP neural network model of qualification layer and target layer of this system are build and modularized. Based this, a double layer and intelligent estimating model is built. The Modularized, double layer structure of this model is propitious to update and develop quickly. At last, this model is trained and verified in MATLAB, the result is accurate.
Autonomous programmable DNA nanorobotic devices using DNAzymes
Authors: John H. Reif, Sudheer Sahu
Venue: Theoretical Computer Science (2009)

A major challenge in nanoscience is the design of synthetic molecular devices that run autonomously (that is, without externally mediated changes per work-cycle) and are programmable (that is, their behavior can be modified without complete redesign of the device). DNA-based synthetic molecular devices have the advantage of being relatively simple to design and engineer, due to the predictable secondary structure of DNA nanostructures and the well-established biochemistry used to manipulate DNA nanostructures. However, ideally we would like to minimize the use of protein enzymes in the design of a DNA-based synthetic molecular device. We present the design of a class of DNA-based molecular devices using DNAzyme. These DNAzyme-based devices are autonomous, programmable, and further require no protein enzymes. The basic principle involved is inspired by a simple but ingenious molecular device due to Tian et al. [Y. Tian, Y. He, Y. Chen, P. Yin, C. Mao, A DNAzyme that walks processively and autonomously along a one-dimensional track, Angew. Chem. Intl. Ed. 44 (2005) 4355-4358] that used DNAzyme to traverse on a DNA nanostructure, but was not programmable in the sense defined above (it did not execute computations). Our DNAzyme-based designs include (1) a finite state automaton, DNAzyme FSA that executes finite state transitions using DNAzymes, (2) extensions to it including probabilistic automaton and non-deterministic automaton, and (3) its application as a DNAzyme router for programmable routing of nanostructures on a 2D DNA addressable lattice. Furthermore, we give a medical-related application, DNAzyme doctor that provides transduction of nucleic acid expression: it can be programmed to respond to the underexpression or overexpression of various strands of RNA, with a response by the release of an RNA. (The behavior of our nucleic acid transduction devices is similar to those of the prior paper of Benenson [Y. Benenson, B. Gil, U. Ben-Dor, R. Adar, E. Shapiro, An autonomous molecular computer for logical control of gene expression, Nature 429 (2004) 423-429], but ours have the advantage that they operate without the use of any protein enzymes.)
Digital Fashion Illustration with Photoshopc and Illustratorc
Authors: Kevin Tallon
Venue:  (2008)

The fashion world has spoken: this book is essential for all visual artists! Kevin Tallons much-anticipated follow up to Creative Fashion Design with Illustrator(R),shows both students and professionals how to unleash their creativity and use the most popular software around. His new work provides valuable insight on how to create those stunning images that grace the covers of todays elite fashion magazines; its a step-by-step technique guide just for fashion illustrators that covers everything from garment sketches and presentation boards to logos and graphics. Here, youll find tips and tricks for advanced layering, scanning, coloring, photo retouching, montages, and much more. Although the book provides instructions on the basics, dont fret: theres plenty of material for those who already know the software!
Security Proofs for Identity-Based Identification and&#x00a0;Signature Schemes
Authors: Mihir Bellare, Chanathip Namprempre, Gregory Neven
Venue: Journal of Cryptology (2008)

This paper provides either security proofs or attacks for a large number of identity-based identification and signature schemes defined either explicitly or implicitly in existing literature. Underlying these is a framework that on the one hand helps explain how these schemes are derived and on the other hand enables modular security analyses, thereby helping to understand, simplify, and unify previous work. We also analyze a generic folklore construction that in particular yields identity-based identification and signature schemes without random oracles.
On solving a special class of weakly nonlinear finite-difference systems
Authors: Emanuele Galligani
Venue: International Journal of Computer Mathematics (2009)

In this paper, we consider the Newton-iterative method for solving weakly nonlinear finite-difference systems of the form F(u)=Au+G(u)=0, where the jacobian matrix G'(u) satisfies an affine invariant Lipschitz condition. We also consider a modification of the method for which we can improve the likelihood of convergence from initial approximations that may be outside the attraction ball of the Newton-iterative method. We analyse the convergence of this damped method in the framework of the line search strategy. Numerical experiments on a diffusion-convection problem show the effectiveness of the method.
Partial-order reduction for general state exploring algorithms
Authors: Dragan Bo&#x0161;na&#x010d;ki, Stefan Leue, Alberto Lluch Lafuente
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2009)

Partial-order reduction is one of the main techniques used to tackle the combinatorial state explosion problem occurring in explicit-state model checking of concurrent systems. The reduction is performed by exploiting the independence of concurrently executed events, which allows portions of the state space to be pruned. An important condition for the soundness of partial-order-based reduction algorithms is a condition that prevents indefinite ignoring of actions when pruning the state space. This condition is commonly known as the cycle proviso. In this paper, we present a new version of this proviso, which is applicable to a general search algorithm skeleton that we refer to as the general state exploring algorithm (GSEA). GSEA maintains a set of open states from which states are iteratively selected for expansion and moved to a closed set of states. Depending on the data structure used to represent the open set, GSEA can be instantiated as a depth-first, a breadth-first, or a directed search algorithm such as Best-First Search or A*. The proviso is characterized by reference to the open and closed set of states of the search algorithm. As a result, it can be computed in an efficient manner during the search based on local information. We implemented partial-order reduction for GSEA based on our proposed proviso in the tool HSF-SPIN, an extension of the explicit-state model checker SPIN for directed model checking. We evaluate the state space reduction achieved by partial-order reduction using the proposed proviso by comparing it on a set of benchmark problems to the use of other provisos. We also compare the use of breadth-first search (BFS) and A*, two algorithms ensuring that counterexamples of minimal length will be found, together with the proviso that we propose.
Academia-academia-industry collaborations on software engineering projects using local-remote teams
Authors: Adrian Rusu, Amalia Rusu, Rebecca Docimo, Confesor Santiago, Mike Paglione
Venue: ACM SIGCSE Bulletin (2009)

It is widely recommended by both academia and industry that today's technology and software engineering students be well prepared for industry before graduation, especially given global outsourcing and other trends. Various methods have been developed to ensure student readiness, including co-ops and capstone courses. These approaches increasingly use real-world projects for their benefits to industry and often to the community at large. In this paper, we argue that students can be prepared to effectively join industry and keep the US technology workforce competitive through a curriculum that includes a theoretical software engineering course with real-world projects and the collaboration of paired teams across two or more universities. We present a case study of a successful teaching experience that features these aspects, and describe the outcome along with the unique perspective of a participating student.