ppxscal/embedding_network huggingface dataset:
High Performance Simulation Platform for Switching and Scheduling
Authors: Shuqiao Chen, Hongchao Hu, Ke Zhu, Yunfei Guo
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Simulation is a significant way for performances’ evaluations in switching and scheduling. The simulation software currently being existed has somewhat limitations in inheritability and extensibility. Based on current switching fabrics, by employing system level design method and object oriented technology, we designed and implemented a simulation platform called SPES for switching and scheduling. Input queuing, output queuing, combined input output queuing and combined input cross-point queuing and corresponding scheduling policies are integrated. Inheritability and extensibility attributes are obtained by designing traffic sources, switching fabrics and scheduling policies separately, and it can support multi-fabric, variable size packets and quality of service model’s simulations. By configuring the platform through a uniform view, users can easily fulfill their concrete simulation environment.
A Dynamic Approach for Discovering Maximal Frequent Itemsets
Authors: Geetha M., R. J. D'Souza
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

We present a novel method, which reads the database at regular intervals as in Dynamic Itemsets Counting Technique and creates a tree called Dynamic Itemset Tree containing items which may be frequent, potentially frequent and infrequent. This algorithm requires less time to discover all maximal frequent itemsets since it involves a method for reducing the size of the database. This method prunes the transactions and items of the transactions which are not of our interest after every scan of the database. Also, this method is independent of the order of the items.
GSA: A Gravitational Search Algorithm
Authors: Esmat Rashedi, Hossein Nezamabadi-pour, Saeid Saryazdi
Venue: Information Sciences: an International Journal (2009)

In recent years, various heuristic optimization methods have been developed. Many of these methods are inspired by swarm behaviors in nature. In this paper, a new optimization algorithm based on the law of gravity and mass interactions is introduced. In the proposed algorithm, the searcher agents are a collection of masses which interact with each other based on the Newtonian gravity and the laws of motion. The proposed method has been compared with some well-known heuristic search methods. The obtained results confirm the high performance of the proposed method in solving various nonlinear functions.
Fast neighbor joining
Authors: Isaac Elias, Jens Lagergren
Venue: Theoretical Computer Science (2009)

Reconstructing the evolutionary history of a set of species is a fundamental problem in biology and methods for solving this problem are gaged based on two characteristics: accuracy and efficiency. Neighbor Joining (NJ) is a so-called distance-based method that, thanks to its good accuracy and speed, has been embraced by the phylogeny community. It takes the distances between n taxa and produces in @Q(n^3) time a phylogenetic tree, i.e., a tree which aims to describe the evolutionary history of the taxa. In addition to performing well in practice, the NJ algorithm has optimal reconstruction radius. The contribution of this paper is twofold: (1) we present an algorithm called Fast Neighbor Joining (FNJ) with optimal reconstruction radius and optimal run time complexity O(n^2) and (2) we present a greatly simplified proof for the correctness of NJ. Initial experiments show that FNJ in practice has almost the same accuracy as NJ, indicating that the property of optimal reconstruction radius has great importance to their good performance. Moreover, we show how improved running time can be achieved for computing the so-called correction formulas.
TouchBall: a design and evaluation of a hand-held trackball based touch-haptic interface
Authors: Minwoo Choi, Gerard Jounghyun Kim
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

In this paper, we present a design and an evaluation of a hand-held trackball based touch-haptic interface, named "TouchBall." Using a trackball mechanism, the device provides flexibility in terms of directional degrees of freedom. It also has an advantage of a direct transfer of force feedback through frictional touch (with high sensitivity), thus requiring only relatively small amount of inertia. This leads to a compact hand-held design appropriate for mobile and 3D interactive applications. The device is evaluated for the detection thresholds for directions of the force feedback and the perceived amount of directional force. The refined directionality information should combine with other modalities with less sensory conflict, enriching the user experience for a given application.
Sanskrit Analysis System (SAS)
Authors: Manji Bhadra, Surjit Kumar Singh, Sachin Kumar, Subash, Muktanand Agrawal, R. Chandrasekhar, Sudhir K. Mishra, Girish Nath Jha
Venue: Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics (2008)

The paper describes Sanskrit Analysis System (SAS) --- a complete analysis system for Sanskrit. Some modules of this system have already been developed. The system accepts full text inputs in Devanāgarī Unicode (UTF-8). The sandhi module does the segmenting for complex tokens and then hands over the text for detailed processing. Currently, the SAS modules have independent interfaces for unit testing at http://sanskrit.jnu.ac.in. The authors are working on the integration process of these modules. The SAS has two major components - the shallow parser and the k(raka analyzer. The shallow parser has separate modules, some of them are partially implemented, and some of them are in the process of being implemented. The modules have been developed as java servlet in unicode using RDMBS techniques. The applications of the SAS will be many ranging from being a Sanskrit reading assistant to machine translation system from Sanskrit to other languages.
On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges
Authors: Eyal Ackerman
Venue: Discrete Computational Geometry (2009)

A topological graph is called k -quasi-planar if it does not contain k pairwise crossing edges. It is conjectured that for every fixed&#x00a0;k, the maximum number of edges in a k-quasi-planar graph on n vertices is&#x00a0;O(n). We provide an affirmative answer to the case k=4.
A dynamic quality-scalable H.264 video encoder chip
Authors: Hsiu-Cheng Chang, Yao-Chang Yang, Jia-Wei Chen, Ching-Lung Su, Cheng-An Chien, Jiun-In Guo, Jinn-Shyan Wang
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

This paper proposes a dynamic quality-scalable H.264 video encoder that comprises 470Kgates and 13.3Kbytes SRAM using 1P8M 0.13&mu;m CMOS technology. Exploiting parameterized algorithms for motion estimation and intra prediction, the proposed design can dynamically configure the encoding modes with the design trade-off between power consumption and video quality for various video encoding applications. It achieves real-time H.264 video encoding on CIF, D1, and HD720@30fps with 7mW-25mW, 27mW-162mW, and 122mW-183mW power dissipation in different quality modes.
Improving Search Engines Performance on Multithreading Processors
Authors: Carolina Bonacic, Carlos Garcia, Mauricio Marin, Manuel Prieto, Francisco Tirado, Cesar Vicente
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

In this paper we present strategies and experiments that show how to take advantage of the multi-threading parallelism available in Chip Multithreading (CMP) processors in the context of efficient query processing for search engines. We show that scalable performance can be achieved by letting the search engine go synchronous so that batches of queries can be processed concurrently in a simple but very efficient manner. Furthermore, our results indicate that the multithreading capabilities of modern CMP systems are not fully exploited when the search engine operates on a conventional asynchronous mode due to the moderate thread level parallelism that can be extracted from a single query.
Testing the locks: verifying security in a Linux environment
Authors: Jeramiah Bowling
Venue: Linux Journal (2009)

Four checks for a more secure network.
Incorporating uncertainty in optimal decision making: Integrating mixed integer programming and simulation to solve combinatorial problems
Authors: Yavuz Acar, Sukran N. Kadipasaoglu, Jamison M. Day
Venue: Computers and Industrial Engineering (2009)

We introduce a novel methodology that integrates optimization and simulation techniques to obtain estimated global optimal solutions to combinatorial problems with uncertainty such as those of facility location, facility layout, and scheduling. We develop a generalized mixed integer programming (MIP) formulation that allows iterative interaction with a simulation model by taking into account the impact of uncertainty on the objective function value of previous solutions. Our approach is generalized, efficient, incorporates the impact of uncertainty of system parameters on performance and can easily be incorporated into a variety of applications. For illustration, we apply this new solution methodology to the NP-hard multi-period multi-product facility location problem (MPP-FLP). Our results show that, for this problem, our iterative procedure yields up to 9.4% improvement in facility location-related costs over deterministic optimization and that these cost savings increase as the variability in demand and supply uncertainty are increased.
State fusion of fuzzy automata with application on target tracking
Authors: Qing E. Wu, Tuo Wang, Yong Xuan Huang, Ji Sheng Li
Venue: Computers Mathematics with Applications (2009)

For better target tracking, this paper presents a new viewpoint that is the states fusion of various fuzzy automata, and mainly discusses the algorithm of the fusion on the states of the fuzzy automata based on Bayesian theory and fuzzy knowledge in detail, respectively. The recurrent neural network architecture corresponding to fuzzy automata is provided for the states fusion of fuzzy automata and the simulation results are given. The simulation results show target tracking based on the states fusion of the fuzzy automata is better than that of single state information of the fuzzy automata relatively. Moreover, the application of fusion of fuzzy automata to track recognition is given. Thus, it will be a theoretic base for the application of any automata. Finally, some problems and development trends on fuzzy automata and neural networks are presented for future research.
Using collaborative, modified peer led team learning to improve student success and retention in intro cs
Authors: Maureen Biggers, Tuba Yilmaz, Monica Sweat
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

It is common knowledge that enrollments in computer science have plummeted and educators are challenged to find ways to engage and promote success and retention of students while maintaining standards in introductory computer science courses. This study focuses on the implementation of a collaborative, modified peer-led team learning (PLTL) instructional approach in a large sized introductory computer science course. The site is a major southeastern university in the United States where all students are required to take one of three introductory computer science classes. The course version selected for this study specifically targets computer science majors and the study spans three years of data, and involves 591 students. Students who experienced the student-centered instruction and worked in small groups facilitated by a peer leader (treatment) in years 2006-07 and 2007-08 were compared with students who experienced a traditional recitation lecture section (control) in 2005-06. The content and the course owner was the same for all three years. Quantitative data analysis show marked and statistically significant improvements in student performance, for both male and female students. These findings suggest that using undergraduate leaders to implement a peer-led team learning model can be as effective in promoting achievement and retention in computer science education as it has shown to be in math and science classes over the past several years.
Architectural enhancements in Stratix-III™ and Stratix-IV™
Authors: David Lewis, Elias Ahmed, David Cashman, Tim Vanderhoek, Chris Lane, Andy Lee, Philip Pan
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

This paper describes architectural enhancements in the Stratix-III" and Stratix-IV" FPGA architectures. These architectures feature programmable power management, which allows the power and performance of logic and routing to be varied to minimize total power without any performance loss. This paper describes the technique used for programmable power management, and describes the experimental evaluation that led to the choice of regions in these architectures. The memory architecture is also explored by adding heterogeneous memory mapping to the FPGA Modeling Toolkit, and used to explore LUT based memory structures. The ALM structure provides more inputs than required for a simple 6 LUT, which can be used with simple modifications to efficiently support simple dual-ported LUT based RAM. Replacing the Stratix-II" small memory blocks with LUT RAM and changing the size of other two memories is shown to reduce overall core area across a set of benchmark designs.
Problems with computer gaming may contribute to retention troubles for CS students
Authors: Anna Hail, Lori Carter
Venue: Journal of Computing Sciences in Colleges (2009)

A failure to retain students that have enrolled in Computer Science programs is one of the contributors to the low production of graduates in the field. The research behind this paper reveals the possibility that a problem with excessive computer gaming is one of the reasons that students do poorly in classes, and consequently drop out of Computer Science programs. Results from a survey taken by 640 Point Loma Nazarene University undergraduate students revealed that Computer Science, Math, and Physics students appear to be significantly more susceptible to problems with computer gaming. This paper presents these results, along with additional information concerning who might be at risk, who plays, why students play, and how their play changed upon entering college.
Transactions on the multiversion B+-tree
Authors: Tuukka Haapasalo, Ibrahim Jaluta, Bernhard Seeger, Seppo Sippu, Eljas Soisalon-Soininen
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

The multiversion B+-tree (MVBT) by Becker et al. assumes a single-data-item update model in which each new version created for a data item is given a timestamp that is unique across the entire MVBT. In this paper, we extend the MVBT model with multi-action transactions such that all (final) data-item versions created by a transaction are given the same timestamp. We show that the MVBT algorithms can be modified to work in a setting in which multiple readonly transactions and a single updating transaction operate concurrently in snapshot isolation on the MVBT, without compromising the asymptotically optimal time complexity of key inserts, key deletes, and key-range scans on any version. The structural consistency and balance of the MVBT is guaranteed by short-duration latching of pages, redo-only logging of structure modifications (version splits, key splits and page merges), and redo-undo logging of key insertions and deletions. The redo pass of our ARIES-based restart-recovery algorithm always produces a structurally consistent and balanced MVBT on which any undo action by a backward-rolling updating transaction can be performed logically if a physical undo is not possible. The standard steal-and-no-force buffering policy is assumed.
Intelligent 3D Face Recognition
Authors: Chao Li
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Face recognition technology has been a focus both in academia and industry for the last couple of years because of its wide potential application and its importance to meet the security needs of today's world. This paper proposes a method to tackle an important problem in 3D face recognition: the deformation of facial geometry that results from the expression changes of a subject. A framework composed of three subsystems: expression recognition system, expressional face recognition system and neutral face recognition system is proposed and implemented. This framework enables more intelligent face recognition. The recognition of faces that were neutral or exhibited one expression, i.e. smiling, was tested on a database of 30 subjects. The results proved the feasibility of this framework.
SpeechGraph - a visual programming toolkit for speech-enabled applications
Authors: Ednaldo Brigante Pizzolato, Agostinho Barone Ribeiro da Silva
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

This paper describes SpeechGraph, a toolkit that puts visual programming (user-friendly graphical interface) and model-driven software development theory together. It allows one to build a simple speech recognition application through a dialogue graph (state machine). Currently, the application generated by the toolkit works only with the NUANCE speech recognition engine.
Explicit time-reversible orbit integration in Particle In Cell codes with static homogeneous magnetic field
Authors: L. Patacchini, I. H. Hutchinson
Venue: Journal of Computational Physics (2009)

A new explicit time-reversible orbit integrator for the equations of motion in a static homogeneous magnetic field - called Cyclotronic integrator - is presented. Like Spreiter and Walter's Taylor expansion algorithm, for sufficiently weak electric field gradients this second order method does not require a fine resolution of the Larmor motion; it has however the essential advantage of being symplectic, hence time-reversible. The Cyclotronic integrator is only subject to a linear stability constraint (@W@Dt
Flexible registration of human motion data with parameterized motion models
Authors: Yen-Lin Chen, Jianyuan Min, Jinxiang Chai
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

This paper presents an efficient model-based approach for automatic human motion registration, which builds temporal correspondences between structurally similar but distinctive motion examples. The key idea of the model-based registration process is to construct a parameterized motion model from a set of preregistered motion examples. With such a model, we can register an input motion with the parameterized motion model by continuously deforming the model to best match the input motion. We formulate the registration process in a gradient-based nonlinear optimization framework by minimizing an objective function that measures differences between the input motion and deforming motion. We also develop a multi-resolution optimization process to efficiently estimate the model parameters as well as the temporal correspondences between the input motion and deforming motion. We demonstrate the performance of our approach by testing the algorithm on difficult motion sequences and comparing with alternative approaches.
Tracking of Returnable Packaging and Transport Units with active RFID in the grocery supply chain
Authors: Alejandro S. Martínez-Sala, Esteban Egea-López, Felipe García-Sánchez, Joan García-Haro
Venue: Computers in Industry (2009)

The fresh products supply chain still has room to improve and increase efficiency and even become an intelligent supply chain by means of automating simple but valuable data flows which will be the foundations and first stage for developing new value-added services. The Spanish company ECOMOVISTAND has developed an innovative and ecological packaging and transport unit, called MT, for the grocery supply chain, which can be used in the entire product cycle; that is, the MT serves (1) as packaging at the producer, (2) as transport unit, (3) as storage at warehouses, and (4) as display stand at the supermarket, all in the same mechanical system, being thus a Returnable Packaging and Transport Unit. An MT needs the support of information technologies to achieve its true potential. In this paper we show the work developed in collaboration with ECOMOVISTAND in order to turn the MT into an intelligent product platform by embedding Active RFID tags. Data flows are integrated into an information system, called MEGASTAND, which allows to track MTs over the entire supply chain and provide value-added services to the customers.
Two hat management: project management with a difference
Authors: Roger W. Kleffman
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The on-line systems of the sixties were marked by an exuberant and dynamic environment of continual system implementations. New hardware, new operating systems, application growth outstripping system capacity---all led to large projects with dedicated manpower and hardware resources trying to achieve superhuman development schedules. The seventies are a different environment. New hardware and operating systems are introduced, providing increased capacity not only for application growth, but also for implementing new applications within the system.
Performance optimization of interference-limited multihop networks
Authors: Ahmed Bader, Eylem Ekici
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

The performance of a multihop wireless network is typically affected by the interference caused by transmissions in the same network. In a statistical fading environment, the interference effects become harder to predict. Information sources in a multihop wireless network can improve throughput and delay performance of data streams by implementing interference-aware packet injection mechanisms. Forcing packets to wait at the head of queues and coordinating packet injections among different sources enable effective control of copacket interference. In this paper, throughput and delay performance in interference-limited multihop networks is analyzed. Using nonlinear probabilistic hopping models, waiting times which jointly optimize throughput and delay performances are derived. Optimal coordinated injection strategies are also investigated as functions of the number of information sources and their separations. The resulting analysis demonstrates the interaction of performance constraints and achievable capacity in a wireless multihop network.
Linear-size log-depth negation-limited inverter for k-tonic binary sequences
Authors: Hiroki Morizumi, Jun Tarui
Venue: Theoretical Computer Science (2009)

In negation-limited complexity, one considers circuits with a limited number of NOT gates, being motivated by the gap in our understanding of monotone versus general circuit complexity. In this context, the study of inverters, i.e., circuits with inputs x"1,...,x"n and outputs @?x"1,...,@?x"n, is fundamental since an inverter with r NOTs can be used to convert a general circuit to one with only r NOTs. Beals, Nishino, and Tanaka [R. Beals, T. Nishino, K. Tanaka, On the complexity of negation-limited Boolean networks, SIAM Journal on Computing 27 (5) (1998) 1334-1347. A preliminary version appears in: Proceedings of STOC95: The 27th Annual ACM Symposium on Theory of Computing, 1995, pp. 585-595] gave a construction of an n-inverter with size O(nlogn), depth O(logn), and @?log"2(n+1)@? NOTs. A zero-one sequence x"1,...,x"n is k-tonic if the number of i's such that x"i