ppxscal/embedding_network huggingface dataset:
The signed domatic number of some regular graphs
Authors: Dirk Meierling, Lutz Volkmann, Stephan Zitzen
Venue: Discrete Applied Mathematics (2009)

Let G be a finite and simple graph with vertex set V(G), and let f:V(G)->{-1,1} be a two-valued function. If @?"x"@?"N"["v"]f(x)>=1 for each v@?V(G), where N[v] is the closed neighborhood of v, then f is a signed dominating function on G. A set {f"1,f"2,...,f"d} of signed dominating functions on G with the property that @?"i"="1^df"i(x)@?1 for each x@?V(G), is called a signed dominating family (of functions) on G. The maximum number of functions in a signed dominating family on G is the signed domatic number on G. In this paper, we investigate the signed domatic number of some circulant graphs and of the torus C"pxC"q.
Study of leakage current mechanisms in ballistic deflection transistors
Authors: Vikas Kaushal, Quentin Diduck, Martin Margala
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

In this paper, the Ballistic Deflection Transistor (BDT) is reviewed for variations in performance of the device including leakage with respect to geometry modifications. Monte Carlo and Silvaco modeling tools are used to study current leakage mechanism in BDT. Low power selection criteria and theory behind position of deflector in the device are examined. Since ballistic conduction is not dissipative, power loss should be low. Leakage can be reduced by placing deflector at about 25% of its own length lower than the exact centre of the device. Current leakages that occurred during device operation are compared with each other and with the output current. It is observed that magnitude of leakage current is distinct at different ports of the device. For a specific set of parameters, leakage is comparable to the output which essentially motivates to choose optimum device architecture.
Joint Image/Video Compression and Encryption via High-Order Conditional Entropy Coding of Wavelet Coefficients
Authors: Xiaolin Wu, Peter W. Moo
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

As the internet and multimedia systems grow in size and popularity, compression and encryption of image and video data are becoming increasingly important. However, independent compression and encryption is too slow for many multimedia applications. This paper presents a new joint compression and encryption method for images and videos that uses high-order conditional entropy coding of wavelet coefficients to facilitate encryption. As a result, state-of-the-art compression and significantly enhanced security are achieved, with no extra computational complexity.
Database education in the new millenium
Authors: Sikha Bagui, Leo Ter Haar
Venue: Journal of Computing Sciences in Colleges (2009)

Database education faces new challenges today. In this paper we present the major challenges faced by database education and the measures that our institution is taking to address these challenges.
Evolutionary multi-criteria trajectory modeling of industrial robots in the presence of obstacles
Authors: R. Saravanan, S. Ramabalan, C. Balamurugan
Venue: Engineering Applications of Artificial Intelligence (2009)

Optimal trajectory planning for robot manipulators is always a hot spot in research fields of robotics. This paper presents two new novel general methods for computing optimal motions of an industrial robot manipulator (STANFORD robot) in presence of obstacles. The problem has a multi-criterion character in which three objective functions, a maximum of 72 variables and 103 constraints are considered. The objective functions for optimal trajectory planning are minimum traveling time, minimum mechanical energy of the actuators and minimum penalty for obstacle avoidance. By far, there has been no planning algorithm designed to treat the objective functions simultaneously. When existing optimization algorithms of trajectory planning tackle the complex instances (obstacles environment), they have some notable drawbacks viz.: (1) they may fail to find the optimal path (or spend much time and memory storage to find one) and (2) they have limited capabilities when handling constraints. In order to overcome the above drawbacks, two evolutionary algorithms (Elitist non-dominated sorting genetic algorithm (NSGA-II) and multi-objective differential evolution (MODE) algorithm) are used for the optimization. Two methods (normalized weighting objective functions method and average fitness factor method) are combinedly used to select best optimal solution from Pareto optimal front. Two multi-objective performance measures (solution spread measure and ratio of non-dominated individuals) are used to evaluate strength of the Pareto optimal fronts. Two more multi-objective performance measures namely optimizer overhead and algorithm effort are used to find computational effort of NSGA-II and MODE algorithms. The Pareto optimal fronts and results obtained from various techniques are compared and analyzed.
A Javascript bouncing ball animation: nifty course assignment presentation
Authors: Jamil Saquer
Venue: Journal of Computing Sciences in Colleges (2009)

This article describes an assignment developed by the author for use in a Web programming course. The assignment uses XHTML, CSS, JavaScript and DHTML for simulating a bouncing ball. The assignment is designed with the goals of being fun and enjoyable and to give students the opportunity to practice working with different topics covered in the course. The article also discusses different ways of modifying the assignment to make it simpler or more challenging.
Discovering Computers 2008, Brief
Authors: Gary B. Shelly, Thomas J. Cashman, Misty E. Vermaat
Venue:  (2007)

Discovering Computers 2008 provides a current and thorough introduction to computers by integrating usage of the World Wide Web with the printed text. This Shelly Cashman Series text offers a complete and engaging solution to successfully teach basic computer concepts with new exercises, case studies, and online tools on the Online Companion. Updated for currency the latest trends in technology and computer concepts are addressed.
A middleware system for protecting against application level denial of service attacks
Authors: Mudhakar Srivatsa, Arun Iyengar, Jian Yin, Ling Liu
Venue: Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware (2006)

Recently, we have seen increasing numbers of denial of service (DoS) attacks against online services and web applications either for extortion reasons, or for impairing and even disabling the competition. These DoS attacks have increasingly targeted the application level. Application level DoS attacks emulate the same request syntax and network level traffic characteristics as those of legitimate clients, thereby making the attacks much harder to be detected and countered. Moreover, such attacks usually target bottleneck resources such as disk bandwidth, database bandwidth, and CPU resources. In this paper we propose server-side middleware to counter application level DoS attacks. The key idea behind our technique is to adaptively vary a client's priority level, and the relative amount of resources devoted to this client, in response to the client's past requests in a way that incorporates application level semantics. Application specific knowledge is used to evaluate the cost and the utility of each request and the likelihood that a sequence of requests are sent by a malicious client. Based on the evaluations, a client's priority level is increased or decreased accordingly. A client's priority level is used by the server side firewall to throttle the client's request rate, thereby ensuring that more server side resources are allocated to the legitimate clients. We present a detailed implementation of our approach on the Linux kernel and evaluate it using two sample applications: Apache HTTPD micro-benchmarks and TPCW. Our experiments show that our approach incurs low performance overhead and is resilient to application level DoS attacks.
Evaluating the correlation between the increasing of the correctness level and McCabe complexity
Authors: Nicolae-Iulian Enescu, Dan Mancas, Ecaterina-Irina Manole, Stefan Udristoiu
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

The scope of our research is finding a correlation between the correctness indicator and the McCabe complexity indicator for software programs. For this, the correctness and McCabe complexity indicators will be calculated for a simple program, written in C programming language. The computations will be made for each program version obtained by correcting different error type found in the testing process. Will be observed there is a closed correlation between correctness and McCabe complexity in the way that for an increasing of the correctness level there will also be a significant increase of the complexity level.
Parameterised Indexed FOR-Loops in Genetic Programming and Regular Binary Pattern Strings
Authors: Gayan Wijesinghe, Vic Ciesielski
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

We present two methods to represent and use parameterised indexed FOR-loops in genetic programming. They are tested on learning the repetitive unit of regular binary pattern strings to reproduce these patterns to user specified arbitrary lengths. Particularly, we investigate the effectiveness of low-level and high-level functions inside these loops for the accuracy and the semantic efficiency of solutions. We used 5 test cases at increasing difficulty levels and our results show the high-level approach producing solutions in at least 19% of the runs when the low-level approach struggled to produce any in most cases.
Weak associativity and restricted rotation
Authors: Jean Marcel Pallo
Venue: Information Processing Letters (2009)

A restricted rotation induced by a weak associative law is introduced. The corresponding equivalence relation is identical to the Glivenko congruence on Tamari lattices, i.e. lattices of binary trees endowed by the well-known rotation operation.
Brief paper: A generalized relay identification method for time delay and non-minimum phase processes
Authors: Tao Liu, Furong Gao
Venue: Automatica (Journal of IFAC) (2009)

A generalized relay identification method is proposed in this paper for time delay and non-minimum phase processes. A distinct merit of the proposed method is that the process gain can be uniformly derived from a single run of the relay test, independent of the relay type being unbiased or biased. An analytical relay response expression is derived for assessing the process response under an unbiased or biased relay test. A frequency response algorithm is also derived for estimating the multiple frequency response points of the process. By categorizing cases of the model parameters to be identified, the corresponding identification algorithms are developed using fitting conditions established for the process response at the oscillation frequency. Based on the improved estimation of multiple frequency response points, a recursive least-squares identification algorithm is then proposed for obtaining further enhanced fitting accuracy over a user specified frequency range, e.g., the low frequency range often concerned in practical controller tuning. Illustrative examples from the recent literature are given to demonstrate the effectiveness and merits of the proposed algorithms.
Scheduling jobs with release dates on parallel batch processing machines
Authors: L. L. Liu, C. T. Ng, T. C. E. Cheng
Venue: Discrete Applied Mathematics (2009)

In this paper we consider the problem of scheduling jobs with release dates on parallel unbounded batch processing machines to minimize the maximum lateness. We show that the case where the jobs have deadlines is strongly NP-hard. We develop a polynomial-time approximation scheme for the problem to minimize the maximum delivery completion time, which is equivalent to minimizing the maximum lateness from the optimization viewpoint.
Research on Extraction of Partial Discharge Signals Based on Wavelet Analysis
Authors: Wenjie Li
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The suppression of noise is crucial prior to any partial discharge (PD) data analysis in on-line PD measurement. Recent research shows that the Wavelet transform (WT) has achieved good effect in noise rejection in on-line PD detection. This paper presents the vital issues of WT implementation in PD signals extraction, including optimal mother wavelet selection, decomposition level selection, threshold rule determination and thresholding function determination. The noise rejection effect of WT de-noising method is proved by simulated and field detected data.
Jungle Jail
Authors: Karim Khenissi, Emilie Clavel
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

A young prisoner enters a crazy jail where anything can happen. Punier and smaller than others, he becomes the scapegoat of all the prisoners. Until the day everything changes, and he becomes the big boss of this crazy place.
Grammatical Inference: Algorithms and Applications 9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings (Lecture ... / Lecture Notes in Artificial Intelligence), 1st edition
Authors: Alexander Clark, Franois Coste, Laurent Miclet
Venue:  (2008)

This book constitutes the refereed proceedings of the 9th International Colloquium on Grammatical Inference, ICGI 2008, held in Saint-Malo, France, in September 2008. The 21 revised full papers and 8 revised short papers presented were carefully reviewed and selected from 36 submissions. The topics of the papers presented vary from theoretical results of learning algorithms to innovative applications of grammatical inference, and from learning several interesting classes of formal grammars to applications to natural language processing.
Beyond the visuals: tactile augmentation and sensory enhancement in an arthroscopy simulator
Authors: Louise Moody, Alan Waterworth, John G. Arthur, Avril D. McCarthy, Peter J. Harley, Rod H. Smallwood
Venue: Virtual Reality (2009)

This paper considers tactile augmentation, the addition of a physical object within a virtual environment (VE) to provide haptic feedback. The resulting mixed reality environment is limited in terms of the ease with which changes can be made to the haptic properties of objects within it. Therefore sensory enhancements or illusions that make use of visual cues to alter the perceived hardness of a physical object allowing variation in haptic properties are considered. Experimental work demonstrates that a single physical surface can be made to &#x2018;feel&#x2019; both softer and harder than it is in reality by the accompanying visual information presented. The strong impact visual cues have on the overall perception of object hardness, indicates haptic accuracy may not be essential for a realistic virtual experience. The experimental results are related specifically to the development of a VE for surgical training; however, the conclusions drawn are broadly applicable to the simulation of touch and the understanding of haptic perception within VEs.
Combining Features for Recognizing Emotional Facial Expressions in Static Images
Authors: Jiří Přinosil, Zdeněk Smékal, Anna Esposito
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)

This work approaches the problem of recognizing emotional facial expressions in static images focusing on three preprocessing techniques for feature extraction such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), and Gabor filters. These methods are commonly used for face recognition and the novelty consists in combining features provided by them in order to improve the performance of an automatic procedure for recognizing emotional facial expressions. Testing and recognition accuracy were performed on the Japanese Female Facial Expression (JAFFE) database using a Multi-Layer Perceptron (MLP) Neural Network as classifier. The best classification accuracy on variations of facial expressions included in the training set was obtained combining PCA and LDA features (93% of correct recognition rate), whereas, combining PCA, LDA and Gabor filter features the net gave 94% of correct classification on facial expressions of subjects not included in the training set.
Point and sketch: collaboration in the hybrid ideation space
Authors: Tomás Dorta, Annemarie Lesage, Edgar Pérez
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

This paper documents a study on collaborative ideation in the Hybrid Ideation Space. Our observations focused on the collaborative nature of conceptual design, as a social process through gestures, graphical and verbal representations, allowing negotiation and decision-making. Two different groups of users participated in this study: a short-term experiment (20 minutes) involving design students working in pairs and a long-term experiment (6 hours) with a team of design practitioners. We have observed that team members participated equally in the reflective conversation while inside immersive sketches, one using the digital pen, the other, the laser pointer.
User-perceived QoS mechanism under SCTP/IPv6
Authors: Dong Yang, Bo Wang, Ping Dong, Hongke Zhang
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Internet has evolved greatly from its original incarnation, such as two new technologies have arisen, SCTP and IPv6 corresponding to TCP and IPv4. Because of the advantages, the new architecture SCTP/IPv6 will replace the TCP/IP architecture very probably in the future. On the other hand, considering that the Internet was designed to meet the different needs of users, the evaluative criteria of a new network design has not changed and it must reduce to the following question: how happy does this design make the users? This paper presents an efficient end-to-end user-perceived QoS mechanism based on SCTP priority multi-stream and IPv6 multi-path, which could provide different end-to-end service quality for different users. Firstly, we present the design principle of new QoS mechanism under SCTP/IPv6; then based on optimization theory and queuing theory, we build two models for new mechanism; finally, based on model analysis we prove the efficiency of the new mechanism.
Numerical modeling of the impact of the Ancão Inlet relocation (Ria Formosa, Portugal)
Authors: J. M. Dias, M. C. Sousa, X. Bertin, A. B. Fortunato, A. Oliveira
Venue: Environmental Modelling Software (2009)

This work describes the application of hydrodynamic (ELCIRC) and transport (VELA and VELApart) models to the Ria Formosa lagoon (Portugal) to study the impact of the relocation of the Ancao Inlet. Located in the south of Portugal, this lagoon is a mesotidal barrier island system that communicates with the sea through 6 inlets. The Old Ancao Inlet was artificially closed and the New Ancao Inlet was relocated into a westward position. This work investigates the hydrodynamic patterns and the potential pathways of tracers in Ria Formosa in two distinct configurations: before and after the Ancao Inlet relocation. The hydrodynamic model was successfully calibrated and validated against elevation, velocity and inlet discharges data, accurately reproducing the tidal propagation. The inlet relocation increases the magnitude of tidal currents, residual velocities and the tidal prism across the bar, suggesting a better stability. The tracers transport simulations suggest enhanced water exchanges through the Ancao Inlet and smaller residence times in the western part of Ria Formosa with the present configuration. Overall, it is concluded that the Ancao Inlet relocation had a positive contribution towards increasing the water renewal of the western part of the lagoon, thus decreasing its vulnerability to pollution.
IUI'09 workshop summary: human interaction with intelligent & networked systems
Authors: Peter Johnson, Christopher Paul Middup, Rachid Hourizi, Mark Maybury
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

This workshop brings together a community of researchers and practitioners to identify and develop the research agenda needed to enhance human interaction with increasingly powerful and independent intelligent systems e.g. sensors networks, autonomous systems, agents and robotic systems. These systems have applications in many domains including health, transport, environment, emergency situations and defense. Aspects of these systems give rise to properties found in loose federations, collaborations and dynamic coalitions. The research questions include awareness, joint working, decision-making, intentionality, coordination, task-allocation, and planning. The workshop brings together researchers from different disciplines to discuss and develop research and to provide a focus for interdisciplinary research in this area.
Exploring Robustness in the Context of Organizational Self-design
Authors: Sachin Kamboj, Keith S. Decker
Venue: Coordination, Organizations, Institutions and Norms in Agent Systems IV: COIN 2008 International Workshops, COIN@AAMAS 2008, Estoril, Portugal, May 12, 2008. COIN@AAAI 2008, Chicago, USA, July 14, 2008. Revised Selected Papers (2009)

Robustness is the ability of a multiagent system to recover from failures and exceptions. In particular, the system should be able to recover from task and agent failures and the failure of any single agent or group of agents should allow the graceful, predictable degradation of performance. Hence, designing robust systems is a critical challenge facing many multiagent designers.Organizational Self-Design (OSD) has been proposed as an approach to constructing suitable organizations at runtime in which the agents are responsible for constructing their own organizational structures. OSD has also been shown to be especially suited for environments that are dynamic and semi-dynamic. However, the problem of making these self-designed organizations robust is still an open research problem that has not been studied to any considerable extent. In this paper, we focus on developing and evaluating robustness mechanisms that can be used by the agents in conjunction with OSD.
Enterprise Knowledge Clouds: Next Generation KM Systems?
Authors: Kemal A. Delic, Jeff A. Riley
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

We are witnessing the emergence of the global, dependable and efficient infrastructure of cloud computing. We assess the current state of the Enterprise Knowledge Management field and project the possible emergence of Enterprise Knowledge Clouds. We give some architectural views, discuss briefly the underlying technologies and describe roughly related applications. We conclude with possible developments in the next five to fifteen years.
A CMOS Resizing Methodology for Analog Circuits
Authors: Timothée Levi, Jean Tomas, Noëlle Lewis, Pascal Fouillat
Venue: IEEE Design Test (2009)

This article presents a CMOS resizing methodology for analog circuits during a technology migration, with easy-to-apply scaling rules based on a simple MOS transistor model. The goals are to transpose a circuit topology from one technology to another while preserving the main figures of merit and to quickly calculate the new transistor dimensions.