ppxscal/embedding_network huggingface dataset:
Mathematical regression model for the prediction of concrete strength
Authors: M. F. M. Zain, Suhad M. Abd, K. Sopian, M. Jamil, A. I. Che-Ani
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

In this study a new mathematical models were proposed and developed using non-linear regression equation for the prediction of concrete compressive strength at different ages. The variables used in the prediction models were from the knowledge of the mix itself, i.e. mix proportion elements. According to the analysis the models provide good estimation of compressive strength and yielded good correlations with the data used in this study. The correlation coefficients were 0.995 and 0.994 for the prediction of 7 and 28 days compressive strength respectively. Moreover, the proposed models proved to be significant tool in prediction compressive strength of different concretes in spite of variations in the results.
Web Accessibility Principles
Authors: Zoe Gillenwater
Venue:  (2007)

Accessibility on the web has been an issue for over a decade, and it remains a crucial - but often overlooked - element of web design. Instructor Zoe Gillenwater explains the concept of accessibility as it applies to the web, and describes how it affects the audience. She also covers how to set up accessibility testing, and how to apply accessibility principles to new and existing sites using standards-compliant markup and CSS. Exercise files accompany the tutorials.Topics Include:Understanding web accessibilityDiscussing Section 508 and WCAG standardsSetting up an accessibility testing environmentCreating accessible page layoutsWorking with textCreating smart navigational elementsWriting proper ALT text for imagesMaking tables and forms accessibleDuration: 6.25 hoursOn 2 CD-ROMs The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
BoSS: a moving strategy for mobile sinks in wireless sensor networks
Authors: Yanzhong Bi, Limin Sun, Na Li
Venue: International Journal of Sensor Networks (2009)

Since sink mobility can alleviate the effects of the hotspot problem in wireless sensor networks and improve network performance, it has attracted much research interest in recent years. Considering the unawareness of energy efficiency in random moving strategies and the lack of flexibility in fixed-track moving strategies, we propose an autonomous moving strategy for the mobile sinks in periodically data-gathering applications in this paper. We first suggest a data-gathering scheme for low-duty cycle sensor networks and then present a mechanics-inspired moving strategy, called BoSS. The moving strategy drives a sink to move towards the nodes with high residual energy and meanwhile, balances energy consumption among the nodes with low energy. Finally, we compare our moving strategy with three near-optimal fixed-track strategies by simulations. The results show that our strategy can not only extend network lifetime notably, but also provide scalability and topology adaptability.
An in vivo database model for pharmacological and physiological dosage for experimental animals
Authors: Ali Gunes, Yusuf Ozturk, Ahmad Babanli
Venue: Computers in Biology and Medicine (2009)

We developed a database compiling in vivo doses of compounds for various activities in certain animal species. The related database covers almost 100 years of experiments. The conceptual scheme of the database was created using concepts of the entity-relationship modeling principles. Using published references, dosages and their effects on laboratory animals were entered as data. As the next stage of our work, we have started to examine the available literature to information about the experimental dosages of various drugs used in other studies. The database provides various interfaces, including graphical-user interfaces and interfaces for Internet access. The database will be useful as a knowledge infrastructure for researchers who have to perform dose-scan experiments for a specific pharmacological activity. The basic benefit of that knowledge infrastructure is that it will enable virtual pharmacological experiments that will be considerably less expensive than conventional laboratory experiments, because the number of animals used and the number of dose-scan experiments will be greatly reduced. The developed database will also be helpful for new drug development studies and for responding to queries about animal types, drugs used, drug interactions, and results.
Dynamic programming with multiple candidates and its applications to sign language and hand gesture recognition
Authors: Sudeep Sarkar
Venue:  (2008)

Dynamic programming has been widely used to solve various kinds of optimization problems. In this work, we show that two crucial problems in video-based sign language and gesture recognition systems can be attacked by dynamic programming with additional multiple observations. The first problem occurs at the higher (sentence) level. Movement epenthesis [1] (me ), i.e., the necessary but meaningless movement between signs, can result in difficulties in modeling and scalability as the number of signs increases. The second problem occurs at the lower (feature) level. Ambiguity of hand detection and occlusion will propagate errors to the higher level. We construct a novel framework that can handle both of these problems based on a dynamic programming approach. The me has only be modeled explicitly in the past. Our proposed method tries to handle me in a dynamic programming framework where we model the me implicitly. We call this enhanced Level Building (eLB) algorithm. This formulation also allows the incorporation of statistical grammar models such as bigrams and trigrams. Another dynamic programming process that handles the problem of selecting among multiple hand candidates is also included in the feature level. This is different from most of the previous approaches, where a single observation is used. We also propose a grouping process that can generate multiple, overlapping hand candidates. We demonstrate our ideas on three continuous American Sign Language data sets and one hand gesture data set. The ASL data sets include one with a simple background, one with a simple background but with the signer wearing short sleeved clothes, and the last with a complex and changing background. The gesture data set contains color gloved gestures with a complex background. We achieve within 5% performance loss from the automatically chosen me score compared with the manually chosen me score. At the low level, we first over segment each frame to get a list of segments. Then we use a greedy method to group the segments based on different grouping cues. We also show that the performance loss is within 5% when we compare this method with manually selected feature vectors.
Modeling and predicting group activity over time in online social media
Authors: Munmun De Choudhury
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

This paper develops a probabilistic framework that can model and predict group activity over time on online social media. Users of social media sites such as Flickr often face the enormous challenge of which group to choose, due to the presence of numerous competing groups of similar content. Determining an empirical measure of significance of a group can help tackle this problem. The proposed framework therefore determines an optimal measure per group based on past user participation and interaction as well as likely future activity in the group. The framework is tested on a Flickr dataset and the results show that this method can yield satisfactory predictions of group activity. This implies that the computed measure of significance of a group can be used by end users to choose groups with rich activity.
On evaluating information visualization techniques
Authors: Carla M. D. S. Freitas, Paulo R. G. Luzzardi, Ricardo A. Cava, Marco Winckler, Marcelo S. Pimenta, Luciana P. Nedel
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

Evaluating user interfaces is usually accomplished to detect design problems in layout and interaction. One possible way to evaluate image quality in computer graphics is visual inspection by experts. Information visualization techniques are usually presented showing their use in experimental situations, employing some kind of analysis. Nevertheless, few works have specifically addressed the evaluation of such techniques. This work reports our results towards the definition of criteria for evaluating information visualization techniques, addressing the evaluation of visual representation and interaction mechanisms as a first step.
Cryptography and Security Services: Mechanisms and Applications
Authors: Manuel Mogollon
Venue:  (2007)

Today's information technology and security networks demand increasingly complex algorithms and cryptographic systems. Individuals implementing security policies for their companies must utilize technical skill and information technology knowledge to implement these security mechanisms. Cryptography and Security Devices: Mechanisms and Applications addresses cryptography from the perspective of the security services and mechanisms available to implement these services: discussing issues such as e-mail security, public-key architecture, virtual private networks, Web services security, wireless security, and the confidentiality and integrity of security services. This book provides scholars and practitioners in the field of information assurance working knowledge of fundamental encryption algorithms and systems supported in information technology and secure communication networks. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Common Technology Engine: A Desktop Quick Reference Version 7.0
Authors: M. C. Dahlmeier
Venue:  (2007)

This is the second book on CommVault's Common Technology Engine and the first in a new series of books relating to Data Management and how CommVault can offer cost-effective, business solutions. In this book I have attempted to expand upon recommended best practices in administration and operation of the Common Technology Engine and included some in depth looks at some of the new features introduced in the 7.0 release. As always, the definitive guide to CommVault's Common Technology Engine and product suite is, and will always be, the latest version of CommVault's Online Books available which can be found on http://documentation.commvault.com. As enhancements and new features are being introduced regularly, if a conflict exists between statements made in this book and the most recent Online Books, the latest version of the later will always be the authoritative source. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Tracking Control of Robot Manipulators via Orthogonal Polynomials Neural Network
Authors: Hongwei Wang, Shuanghe Yu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

In this paper, an orthogonal functions neural network is used to achieve the control of nonlinear systems. The adaptive controller is constructed by using Chebyshev orthogonal polynomials neural network, which has advantages such as simple structure and fast convergence speed. The adaptive learning law of orthogonal neural network is derived to guarantee that the adaptive weight errors and tracking errors are bound by using Lyapunov stability theory. Simulation results are given for a two-link robot in the end of the paper, and the control scheme is validated.
Why Is This Web Page Coming Up so Slow? Investigating the Loss of SYN Packets
Authors: Dragana Damjanovic, Philipp Gschwandtner, Michael Welzl
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

Before the first valid calculation of the round trip time for a connection, TCP sets an initial value for the retransmission timeout to 3 seconds which, in the case of the first packets getting lost, introduces a long delay. For short transfers, like web traffic, this could have a significant influence on the performance. We performed measurements to investigate how often this happens. As our measurements show, control packets (SYN and SYN/ACK packets) do get lost and delays of 3 seconds or even more (further timeouts) occur. By means of a simple example implementation, we indicate that this problem could be solved.
Interactive GIS-based interface for time-critical application
Authors: Wenjuan Fan, Anhong Ling, Xiang Li, Gang Liu, Jian Zhan, Lian Li, Yongzhong Sha
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

Many time-critical applications, such as emergency evacuation, demand decision-makers to make prompt decisions under time pressure. Therefore, it is essential to design an intuitive and interactive user interface to present critical information to users so that they can make effective decisions in time-critical situations. Using Ajax technology, this paper designs a GIS-based, flexible and interactive user interface to meet the aforementioned requirements.
Evaluation of weight perception during unimanual and bimanual manipulation of virtual objects
Authors: Christos Giachritsis, Jorge Barrio, Manuel Ferre, Alan Wing, Javier Ortego
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

Design of haptic interfaces for precise bimanual manipulation should take into account how weight simulation is implemented when manipulation switches between one and two hands. The importance of this is apparent in tasks where the user requires to apply vertical forces to penetrate a surface with a tool or splice a fragile object using one and/or two hands. Accurate perception of simulated weight should allow the user to execute the task with high precision. Here, we evaluated unimanual and bimanual weight perception when lifting virtual boxes of different weights with precision grip in a coupled Master Finger 2 setup. Initial results with virtual weights are similar to results from studies which used real weights [1] even though the users appear to be less sensitive to virtual weights. Implications for haptic interface design are discussed.
Prediction of energy consumption behavior in component-based distributed systems
Authors: Nenad Medvidovic
Venue:  (2008)

Component-based distributed systems are increasingly deployed onto heterogeneous embedded platforms with limited battery resources. In this domain, it is crucial to provide an effective approach that enables an engineer to build energy-efficient component-based distributed systems throughout the entire development cycle spanning system design-time, construction-time, and runtime. To address this problem, this dissertation first presents a framework that (1) facilitates early estimation of the energy consumption induced by an architectural style in a component-based distributed system, and (2) consequently enables an engineer to use energy consumption estimates along with other quality attributes in determining the most appropriate style for a given distributed system during design-time.As the second part of the solution, this dissertation provides a framework that allows the system engineer to estimate the energy consumption of a component-based distributed system implemented in Java at the level of its components, both during system construction-time and during runtime. We also present several practical applications of the framework, which can be effected either at system construction-time or at runtime for reducing the distributed system&rsquo;s energy consumption and consequently increasing the lifetime of the system's key services.Our overall approach, composed of the above two estimation frameworks, has been evaluated empirically on a large number of distributed application scenarios, and xii produced very accurate energy consumption estimates. The dissertation concludes with several open research questions that will frame our future work.
On the Fly Estimation of the Processes that Are Alive in an Asynchronous Message-Passing System
Authors: Achour Mostefaoui, Michel Raynal, Gilles Tredan
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

It is well known that in an asynchronous system where processes are prone to crash, it is impossible to design a protocol that provides each process with the set of processes that are currently alive. Basically, this comes from the fact that it is impossible to distinguish a crashed process from a process that is very slow or with which communications are very slow. Nevertheless, designing protocols that provide the processes with good approximations of the set of processes that are currently alive remains a real challenge in fault-tolerant-distributed computing. This paper proposes such a protocol, plus a second protocol that allows to cope with heterogeneous communication networks. These protocols consider a realistic computation model where the processes are provided with nonsynchronized local clocks and a function \alpha () that takes a local duration \Delta as a parameter, and returns an integer that is an estimate of the number of processes that could have crashed during that duration \Delta. A simulation-based experimental evaluation of the proposed protocols is also presented. These experiments show that the protocols are practically relevant.
Proceedings of the 45th Annual Meeting of the ACL: Student Research Workshop
Venue: International Conference On Computational Linguistics (2007)

On behalf of the Organizing Committee, we are pleased to present the proceedings of the Student Research Workshop held at the 45th Annual Meeting of the Association for Computational Linguistics (ACL) in Prague, Czech Republic, June 25--27, 2007. The Student ResearchWorkshop is an established tradition at the Annual Meetings of the Association for Computational Linguistics and builds on the success of no less than 16 previous student sessions at ACL meetings. Students in Computational Linguistics, Natural Language Processing and related fields were offered the possibility to present their work in a setting embedded in the main conference. The workshop plays an integral role in ACL's efforts to build and maintain a research community by investing in young researchers that will shape the field in the years to come. The workshop aimed at providing feedback from senior to beginner researchers. In the call for papers, we explicitly aimed at students in an early stage of their Ph.D. work. We felt that this group could gain the most benefit from this event, as the experts' feedback can still influence their research directions. The Program Committee was compiled such that about half of the reviewers were students or young researchers, and the other half consisted of senior scientists. This mixture ensures that the scientific quality of reviews is high, while student-specific issues are well understood by the committee members. We are indebted to our 52 reviewers for their elaborate, thoughtful and high quality reviews, which will also be of great help to those students whose work could not be accepted for presentation. We received 52 submissions from all over the world, of which 16 were accepted for presentation: 9 for oral presentation and 7 for poster presentation. The presentation format was assigned based on thoughts about how the work could be presented best, and does not indicate a quality difference among papers, which are all fixed to the same length of 6 pages.
Algorithm Library based on Algorithmic CyberFilms
Authors: Yutaka Watanobe, Nikolay Mirenkov, Rentaro Yoshioka
Venue: Proceeding of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07 (2007)

A library of algorithms developed as algorithmic cyberFilms is presented. The algorithmic cyberFilms are a new type of software components for presentation, specification/programming, and automatic code generation of computational algorithms. The algorithmic cyberFilm format is implemented as a set of multimedia frames (and scenes), and each library component is demonstrated by frames of algorithmic skeletons representing dynamical features of an algorithm, by frames of integrated view providing static features of the algorithm in a compact format, and by corresponding program templates supporting the code generation. We developed the library which is a collection of typical algorithms taught in university courses, including computation on grids, trees, and graphs. In this paper, we show basic constructs of visual languages which are used for representing cyberFilms as well as for demonstrating the library components. We also show a general overview of the library and its features. In addition, we discuss results of an experiment which was conducted to verify the usability of the library components and their usefulness in education.
SNARE: a link analytic system for graph labeling and risk detection
Authors: Mary McGlohon, Stephen Bay, Markus G. Anderle, David M. Steier, Christos Faloutsos
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of fraud detection due to the high cost of fraud, and being able to automatically detect potential fraud quickly and precisely allows human investigators to work more efficiently. Many data analytic schemes have been put into use; however, schemes that bolster link analysis prove promising. This work builds upon the belief propagation algorithm for use in detecting collusion and other fraud schemes. We propose an algorithm called SNARE (Social Network Analysis for Risk Evaluation). By allowing one to use domain knowledge as well as link knowledge, the method was very successful for pinpointing misstated accounts in our sample of general ledger data, with a significant improvement over the default heuristic in true positive rates, and a lift factor of up to 6.5 (more than twice that of the default heuristic). We also apply SNARE to the task of graph labeling in general on publicly-available datasets. We show that with only some information about the nodes themselves in a network, we get surprisingly high accuracy of labels. Not only is SNARE applicable in a wide variety of domains, but it is also robust to the choice of parameters and highly scalable-linearly with the number of edges in a graph.