ppxscal/embedding_network huggingface dataset:
Automated usability testing framework
Authors: Fiora T. W. Au, Simon Baker, Ian Warren, Gillian Dobbie
Venue: Proceedings of the ninth conference on Australasian user interface - Volume 76 (2008)

Handheld device applications with poor usability can reduce the productivity of users and incur costs for businesses, thus usability testing should play a vital role in application development. Conventional usability testing methodologies, such as formal user testing, can be expensive, time consuming and labour intensive; less resource-demanding alternatives can yield unreliable results. Automating aspects of usability testing would improve its efficiency and make it more practical to perform throughout development. An automated usability testing tool should capture as input the properties of an application's graphical user interface, the sequence of user actions as they use the application to achieve particular tasks, their behaviour and comments, as well as a description of these tasks. The tool should evaluate both the static and dynamic properties of the interface, examine navigational burden and suggest modifications or templates that would improve usability. Results should be quick and easy to interpret, and be understandable by personnel other than specialised testers. Several existing tools that are typical of the tools available today meet some but not all of these requirements. In this paper we describe the design of the HUIA testing framework, in which we have to meet as many of these requirements as possible.
Novel formulations for the sequence selection problem in de novo protein design with flexible templates
Authors: H. K. Fung, M. S. Taylor, C. A. Floudas
Venue: Optimization Methods Software (2007)

This paper presents two novel formulations for solving the sequence selection problem in de novo protein design with highly flexible templates, each of which exhibits a crystal or NMR, structure. The first formulation applies weighted average energy parameters to incorporate information about every structure, with the weights, which are parameters dependent on a pair of Cα positions and a particular distance bin, given by the probability that the distance between the two positions is found to belong to that distance bin in any of the structures. The second formulation allows the distance between the two positions considered to fall into any distance bin that all the structures span over, but imposes novel linear constraints to ensure a physically consistent structure. Both formulations were tested on redesigning Compstatin, the template of which has 21 NMR structures from the protein data bank.
A clustering model for memory resource sharing in large scale distributed system
Authors: Rui Chu, Nong Xiao, Xicheng Lu
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

As an application of large scale distributed network computing system, RAM Grid tries to solve the problem of memory resource sharing and utilization. Due to the special properties of memory, traditional resource information management approaches cannot be adapted easily. This paper proposes a clustering based resource aggregating scheme under the background of RAM Grid, which can reduce the scale of resource information management efficiently. With analogy to the force field and potential energy theory in physics, the basic model, the force field-potential energy model, and the corresponding distributed algorithms are proposed, respectively. The model and algorithms are also evaluated by real network topologies based simulation.
A fast and accurate technique for mapping parallel applications on stream-oriented MPSoC platforms with communication awareness
Authors: Martino Ruggiero, Alessio Guerri, Davide Bertozzi, Michela Milano, Luca Benini
Venue: International Journal of Parallel Programming (2008)

The problem of allocating and scheduling precedence-constrained tasks on the processors of a distributed real-time system is NP-hard. As such, it has been traditionally tackled by means of heuristics, which provide only approximate or near-optimal solutions. This paper proposes a complete allocation and scheduling framework, and deploys an MPSoC virtual platform to validate the accuracy of modelling assumptions. The optimizer implements an efficient and exact approach to the mapping problem based on a decomposition strategy. The allocation subproblem is solved through Integer Programming (IP) while the scheduling one through Constraint Programming (CP). The two solvers interact by means of an iterative procedure which has been proven to converge to the optimal solution. Experimental results show significant speed-ups w.r.t. pure IP and CP exact solution strategies as well as high accuracy with respect to cycle-accurate functional simulation. Two case studies further demonstrate the practical viability of our framework for real-life applications.
Create, sync, share: the role of mobile device on social entity
Authors: Rhee Youngho, Shim Jennifer, Kim Junghun, Chung Amy
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

The features of a mobile device already penetrate everyday life and support every moment in life. Mobile connection between people does not imply only communication way, rather it means a gateway to connect virtual world as well. In the present study, mobile device close a gadget recording everyday life named "Life diary". The life diary is embedded mobile phone application and automatically summarizes user's daily life and encourages looking back previous events. Life diary's value proposition exits in keeping memories and sharing them automatically among phone, pc, and web in a systematical way.
Model-on-demand MATLAB toolbox for fault diagnosis
Authors: Hajrudin Efendic
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

The modeling and fault diagnosis in complex systems must involve a kind of trade-off between computational efficiency and demands for precision of fault diagnosis. In this paper a software prototype for fault diagnosis of complex systems, utilizing an approach which deals with those two opposite requests, has been presented.
An approximation algorithm for sorting by reversals and transpositions
Authors: Atif Rahman, Swakkhar Shatabda, Masud Hasan
Venue: Journal of Discrete Algorithms (2008)

Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a combinatorial problem of sorting by reversals and transpositions, the problem of finding a shortest sequence of reversals and transpositions that sorts one genome into the other. In this paper we present a 2k-approximation algorithm for sorting by reversals and transpositions for unsigned permutations where k is the approximation ratio of the algorithm used for cycle decomposition. For the best known value of k our approximation ratio becomes 2.8386+@d for any @d>0. We also derive a lower bound on reversal and transposition distance of an unsigned permutation.
Low-complexity frequency-domain algorithm for UWB timing
Authors: Jianfeng Hu, Tiejun Lv
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

In this paper, a low-complexity frequency-domain algorithm is proposed for Ultra Wideband (UWB) timing in multipath environment. By constructing the reasonable transmitted model, the algorithm can be carried out in frequency domain efficiently, inter symbol interference (ISI) and inter frame interference (IFI) are mitigated. Relative path delays and attenuations come out as by-products by one-dimensional searching. Most importantly, our timing algorithm has a very low computational requirement, which stems from simple addition and multiplication among vectors. The mean square errors (MSE) and bit error rate (BER) of this scheme are tested at the end of this paper. And comparisons demonstrate our algorithm outperforms another frequency processing method proposed in [1], [2].
Manifold mapping: a two-level optimization technique
Authors: D. Echeverr&#x00ed;a, P. W. Hemker
Venue: Computing and Visualization in Science (2008)

In this paper, we analyze in some detail the manifold-mapping optimization technique introduced recently [Echeverr&#x00ed;a and Hemker in space mapping and defect correction. Comput Methods Appl Math 5(2): 107&#x2014;136, 2005]. Manifold mapping aims at accelerating optimal design procedures that otherwise require many evaluations of time-expensive cost functions. We give a proof of convergence for the manifold-mapping iteration. By means of two simple optimization problems we illustrate the convergence results derived. Finally, the performances of several variants of the method are compared for some design problems from electromagnetics.
Modeling and Simulation of 6-Pulse and 12-Pulse Rectifiers under Balanced and Unbalanced Conditions with Impacts to Input Current Harmonics
Authors: Arief Hernadi, Taufik, Makbul Anwari
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper discusses the impact of using 6-pulse and 12-pulse rectifier circuit commonly found in Adjustable Speed Drives. The 12-pulse topology is known to be more expensive, but produce the least input current harmonics. However, the latter statement is completely true under balanced line conditions. In practice, the lines are inherently unbalanced. Hence, the question of whether the 12-pulse rectifier will indeed perform better in terms of the harmonics injected to the line is still under on-going discussions. This paper presents the modeling and simulation of both rectifier topologies to compare their input current harmonics. The rectifiers are modeled using OrCAD Pspice and several common cases of line conditions will be simulated to compare their harmonic levels. Results of the simulations pertaining to their Total Harmonic Distortions for each case will be explored.
Highlighting space-time patterns: Effective visual encodings for interactive decision-making
Authors: M. Sips, J. Schneidewind, D. A. Keim
Venue: International Journal of Geographical Information Science (2007)

The research reported in this paper focuses on integrating analytical and visual methods in order to explore complex patterns in geo-related multivariate data sets and to understand the changes in patterns over time. The goal is to provide techniques that are able to analyse real-world Data Warehouses, a typical architecture to manage such geo-related multidimensional data sets, in order to support the analyst's decision-making process. Challenges arise because real-world applications usually have to deal with millions of records, with dozens of dimensions, and spatio-temporal context. Therefore, a tight integration of automated analysis and interactive visualizations is needed (as proposed in the context of Visual Analytics). Our approach uses the well-studied capabilities provided by Data Warehouses supporting knowledge discovery and decision-making to analyse spatio-temporal behaviour of pattern in high-dimensional spaces. The topic of the paper is to show possible interplays between automated analysis and geo-spatial visualization.
Hierarchical multi-pattern matching algorithm for network content inspection
Authors: Tzu-Fang Sheu, Nen-Fu Huang, Hsiao-Ping Lee
Venue: Information Sciences: an International Journal (2008)

Inspection engines that can inspect network content for application-layer information are urgently required. In-depth packet inspection engines, which search the whole packet payload, can identify the interested packets that contain certain patterns. Network equipment then utilizes the searching results from the inspection engines for application-oriented management. The most important technology for fast packet inspection is an efficient multi-pattern matching algorithm to perform exact string matching between packets and a large set of patterns. This paper proposes a novel hierarchical multi-pattern matching algorithm (HMA) for packet inspection. HMA builds hierarchical index tables from the most frequent common-codes, and efficiently reduces the amount of external memory accesses and memory space by two-tier and cluster-wise matching. Analysis and simulation results reveal that HMA performs much better than state-of-the-art matching algorithms. In particular, HMA can update patterns incrementally, thus creating a reliable network system.
Visual registering of arm pose: a space robotics application
Authors: Aldo Cumani, Sandra Denasi, Antonio Guiducci, Piergiorgio Lanza, Giorgio Quaglia
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

This paper deals with the vision algorithms designed for ESA's Eurobot Flight Model, a robotic system planned to assist astronauts on the International Space Station during extra-vehicular activities. The algorithm for registering the robot's pose with respect to the station is presented, together with some preliminary results from laboratory simulations.
A New Human Interactive Proofs System for Deaf Persons
Authors: Sajad Shirali-Shahreza, Mohammad Shirali-Shahreza
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Nowadays the Internet users are from different ages and groups. Disabled people are a group of the Internet users. Some websites are especially created for disabled people and public access to them is undesirable. In this paper, for the first time, a method is introduced for distinguishing between deaf persons and other users using a new HIP (Human Interactive Proofs) system. In this method, the sign language is used. A word is shown as a movie using a sign language. The user should recognize the word and select it from a list. Only deaf persons can understand sign language and recognize the word, therefore other persons and also computer programs cannot enter the website. This project has been implemented by PHP scripting language.
A Ubiquitous Supervisory System Based on Social Context Awareness
Authors: Takuo Suganuma, Kazuhiro Yamanaka, Yoshikazu Tokairin, Hideyuki Takahashi, Norio Shiratori
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

We propose a supervisory system that deals with actual situations and social aspects of users in ubiquitous computing environment in this paper. To realize a gentle and safe supervision, we have to consider social relationships between observers and the watched person to give adequate level of privacy to the services. We propose "uEyes'', a ubiquitous supervisory system that introduces a new feature for the supervision, i.e., Social Context Awareness. By using this feature, environmental information acquired from real world and knowledge on social activities of people are integrated effectively. From experimental results using a prototype of uEyes for supervising elderly people, we show that the social context awareness, as well as other components of the system, effectively works to support the supervision.
A New Dynamic Pricing Scheme with Call Admission Control to Reduce Network Congestion
Authors: Mehrdad Manaffar, Hamidreza Bakhshi, Mostafa Pilevari
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Due to the importance of congestion in networks, we look for a method that can reduce the network congestion. in recent years considerable efforts have focus on the call admission control that provide the desired QoS but cannot reduce the network congestion, so in this paper we introduce a new scheme that add an additional dimension (dynamic pricing) to CAC in order to reduce congestion. Dynamic pricing encourages users to use resources efficiency. In this scheme price depends on the network load so it can reduce congestion. We compare the performance of our scheme in term of congestion prevention with conventional systems where no pricing block is implemented. These results show improvement that can be achieved by the integration of pricing in the call admission control process in networks.
Adopting an agile methodology: why it did not work
Authors: Iva Krasteva, Sylvia Ilieva
Venue: Proceedings of the 2008 international workshop on Scrutinizing agile practices or shoot-out at the agile corral (2008)

The paper presents a case study on the adoption of an agile methodology and more particularly the things that worked and the ones that didn't work when three teams implemented their first agile project. The study describes those characteristics of the teams and projects that are important for the further analysis of the obtained results. The presented analysis identifies both shortcomings and benefits of the agile approach.
Energy-optimal distributed algorithms for minimum spanning trees
Authors: Yongwook Choi, Maleq Khan, V.S. Anil Kumar, Gopal Pandurangan
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Traditionally, the performance of distributed algorithms has been measured in terms of time and message complexity. Message complexity concerns the number of messages transmitted over all the edges during the course of the algorithm. However, in energy-constraint radio or wireless networks (e.g., sensor networks), energy is a critical factor in measuring the efficiency of a distributed algorithm. Transmitting a message between two nodes has an associated cost (energy) and moreover this cost can depend on the two nodes (e.g., the distance between them among other things). Thus in addition to the time and message complexity, it is important to consider energy complexity that accounts for the total energy associated with the messages exchanged among the nodes in a distributed algorithm, and design energy-efficient distributed algorithms for energy-constraint networks. This paper addresses the minimum spanning tree (MST) problem, an important problem in distributed computing. We study energy-efficient distributed algorithms for the Euclidean MST problem assuming random distribution of nodes. We show a non-trivial lower bound of Ω(log n) on the energy complexity of any distributed MST algorithm. We then give a distributed algorithm that constructs an optimal MST with energy complexity O(logn) on average and O(log n log log n) with high probability. This is an improvement over the previous best known bound on the average energy complexity of Ω(log2 n). All the above results assume that nodes do not know their geometric coordinates. If the nodes know their own coordinates, then we give an algorithm with O(1) energy complexity (which is the best possible) that gives an O(1) approximation to the MST.
Increasing the size of a network by a constant factor can increase performance by more than a constant factor
Authors: R. R. Kock
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

In one routing scheme which has been implemented on a parallel architecture based on the butterfly graph, messages are sometimes destroyed. It is shown that if messages are sent to random destinations, the expected number of messages that reach their destinations is Theta (n(log n)-1/q), where n is the size of the butterfly graph and q is the number of messages that can move through one edge (or, equivalently, vertex) in one time step. In the analysis of this problem, interesting techniques for solving nonlinear systems of difference equations are developed that could have applications to other problems.
A new heuristic routing algorithm with Hamiltonian Cycle Protection in survivable networks
Authors: Lei Guo, Xingwei Wang, Juan Du, Tengfei Wu
Venue: Computer Communications (2008)

In high speed backbone networks, the survivability is a very important issue since the networks carry a lot of traffic. In this paper, we study the protection method with Hamiltonian Cycle in meshed survivable backbone networks, and proposed a new heuristic routing algorithm called Enhanced Hamiltonian Cycle Protection (EHCP) to tolerate the single failure. In EHCP, for each connection request the working path can be effectively selected based on the presented link-cost functions that consider the different affection for backup resources from on-cycle links and straddling links so that the backup resources on the protecting Hamiltonian Cycle can be reduced. The simulation results show that, compared with the conventional Hamiltonian Cycle Protection algorithm, EHCP can obtain significant improvement in resource utilization ratio.
Predicting information seeker satisfaction in community question answering
Authors: Yandong Liu, Jiang Bian, Eugene Agichtein
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Question answering communities such as Naver and Yahoo! Answers have emerged as popular, and often effective, means of information seeking on the web. By posting questions for other participants to answer, information seekers can obtain specific answers to their questions. Users of popular portals such as Yahoo! Answers already have submitted millions of questions and received hundreds of millions of answers from other participants. However, it may also take hours --and sometime days-- until a satisfactory answer is posted. In this paper we introduce the problem of predicting information seeker satisfaction in collaborative question answering communities, where we attempt to predict whether a question author will be satisfied with the answers submitted by the community participants. We present a general prediction model, and develop a variety of content, structure, and community-focused features for this task. Our experimental results, obtained from a largescale evaluation over thousands of real questions and user ratings, demonstrate the feasibility of modeling and predicting asker satisfaction. We complement our results with a thorough investigation of the interactions and information seeking patterns in question answering communities that correlate with information seeker satisfaction. Our models and predictions could be useful for a variety of applications such as user intent inference, answer ranking, interface design, and query suggestion and routing.