ppxscal/embedding_network huggingface dataset:
Guidelines for Eliciting Usability Functionalities
Authors: Natalia Juristo, Ana Moreno, Maria-Isabel Sanchez-Segura
Venue: IEEE Transactions on Software Engineering (2007)

Like any other quality attribute, usability imposes specific constraints on software components. Features that raise the software system's usability level have to be considered from the earliest development stages. However, discovering and documenting usability features is likely to be beyond the usability knowledge of most requirements engineers, developers and users. We propose an approach based on elicitation patterns that capitalise upon key elements recurrently intervening in the usability features elicitation and specification process. Pattern use furnishes requirements analysts with a knowledge repository that helps them to ask the right questions and capture precise usability requirements information.
Hybrid Runtime Management of Space-Time Heterogeneity for Parallel Structured Adaptive Applications
Authors: Xiaolin Li, Manish Parashar
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Structured adaptive mesh refinement (SAMR) techniques provide an effective means for dynamically concentrating computational effort and resources to appropriate regions in the application domain. However, due to their dynamism and space-time heterogeneity, scalable parallel implementation of SAMR applications remains a challenge. This paper investigates hybrid runtime management strategies and presents an adaptive hierarchical multi-partitioner (AHMP) framework. AHMP dynamically applies multiple partitioners to different regions of the domain, in a hierarchical manner, to match the local requirements of the regions. Key components of the AHMP framework include a segmentation-based clustering algorithm (SBC) that can efficiently identify regions in the domain with relatively homogeneous partitioning requirements, mechanisms for characterizing the partitioning requirements of these regions, and a runtime system for selecting, configuring and applying the most appropriate partitioner to each region. Further, to address dynamic resource situations for long running applications, AHMP provides a hybrid partitioning strategy (HPS), which involves application-level pipelining, trading space for time when resources are sufficiently large and under-utilized, and an application-level out-of-core strategy (ALOC), trading time for space when resources are scarce in order to enhance the survivability of applications. The AHMP framework has been implemented and experimentally evaluated on up to 1280 processors of the IBM SP4 cluster at San Diego Supercomputer Center.
A Mobile Beacon Based Approach for Sensor Network Localization
Authors: Jacques M. Bahi, Abdallah Makhoul, Ahmed Mostefaoui
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Mobile beacon localization approaches have been pro- posed in the literature as an interesting alternative for cen- tralized/decentralized approaches because of their low cost, their accuracy and their low energy consumption. However, their main drawback in a random deployment remains the lack of a well defined mobile beacon trajectory that ensures localization for all the nodes with acceptable error estima- tions. In this paper we give a solution to the question "What is the optimum mobile beacon trajectory and when should the beacon packets be sent?", and then we propose a sim- ple localization algorithm. This algorithm is based on one mobile beacon. We study three different known curves and we justify the use of the Hilbert space filling curve to be the mobile beacon trajectory. We further compare the local- ization error of our proposed algorithm and other existing mobile beacon based algorithms. Our results are verified by simulation on Omnet++.
A Configurable Processor Synthesis System
Authors: Wanda Gay, Clay Gloster,  Jr.
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

In this paper we present a Configurable Digital Signal Processor Synthesis (CPS) System that produces a library of high-performance processors wherein each processor executes a specific digital signal processing (DSP) algorithm. Each processor contains a small instruction set and implements a particular application. These algorithm specific DSPs (ASDSPs) are used to alleviate bottlenecks in software by replacing computationally intense portions of a high level DSP algorithm with custom hardware. Each ASDSP generated by the CPS system is individually loaded into a commercially available configurable system. A library of algorithm specific DSPs for a sample application set of fundamental complex arithmetic modules is generated using the CPS system. The resulting library of floating point processors is implemented on a Firebird FPGA board containing a Virtex XCV2000E FPGA part. The results are compared with a comparable software algorithm implemented on a 2.79 GHz Pentium IV general purpose processor. This comparison shows that, despite having a clock speed that is an order of magnitude slower than the microprocessor (54MHZ versus 2.79 GHZ), the proposed ASDSP ran an order of magnitude (13X) faster than the microprocessor implementation in the best case.
Unifying data and domain knowledge using virtual views
Authors: Lipyeow Lim, Haixun Wang, Min Wang
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

The database community is on a constant quest for better integration of data management and knowledge management. Recently, with the increasing use of ontology in various applications, the quest has become more concrete and urgent. However, manipulating knowledge along with relational data in DBMSs is not a trivial undertaking. In this paper, we introduce a novel, unified framework for managing data and domain knowledge. We provide the user with a virtual view that unifies the data, the domain knowledge and the knowledge inferable from the data using the domain knowledge. Because the virtual view is in the relational format, users can query the data and the knowledge in a seamlessly integrated manner. To facilitate knowledge representation and inferencing within the database engine, our approach leverages XML support in hybrid relational-XML DBMSs (e.g., Microsoft SQL Server & IBM DB2 9 PureXML). We provide a query rewriting mechanism to bridge the difference between logical and physical data modeling, so that queries on the virtual view can be automatically transformed to components that execute on the hybrid relational-XML engine in a way that is transparent to the user.
Comparative study of metrics for evaluation of object localisation by bounding boxes.
Authors: B. Hemery, H. Laurent, C. Rosenberger
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper deals with a comparative study of metrics allowing the evaluation of results provided by object localization algorithms. We particulary focus on localization by the bounding box representation. 26 metrics are studied in this paper. A protocol is presented for the creation of ground truths and synthetic results of localization algorithms. These synthetic results permit to simulate several inaccuracies (translation, scale errors. . . ) and to study the metrics behaviors face to the considered alterations. Finally, some conclusions and perspectives are given.
SAT-based Bounded Model Checking for SE-LTL
Authors: Zhou Conghua, Ju Shiguang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

For concurrent software systems state/event linear temporal logic SE-LTL is a specification language with high expressive power and the ability to reason about both states and events. Until now, SE-LTL model checking algorithm is still explicit. We introduce a bounded model checking procedure for SE-LTL which reduces model checking to propositional satisfiability. This new technique avoids the space blow up of BDDs, generates counterexamples much faster, and sometimes speeds up the verification. For SE-LTL_X we further show how to integrate the procedure and stuttering equivalent technique. The experiment result shows that the integration can reduce the verification time very much.
ASFALT: A Simple Fault-Tolerant Signature-based Localization Technique for Emergency Sensor Networks
Authors: Murtuza Jadliwala, Shambhu Upadhyaya, Manik Taneja
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

We consider the problem of robust node deployment and fault-tolerant localization in wireless sensor networks for emergency and first response applications. Signature-based localization algorithms are a popular choice for use in such applications due to the non-uniform nature of the sensor node deployment. But, random destruction/disablement of sensor nodes in such networks adversely affects the deployment strategy as well as the accuracy of the corresponding signature-based localization algorithm. In this paper, we first model the phenomenon of sensor node destruction as a non-homogeneous Poisson process and derive a robust and efficient strategy for sensor node deployment based on this model. Next, we outline a protocol, called Group Selection Protocol, that complements current signature-based algorithms by reducing localization errors even when some nodes in a group are destroyed. Finally, we propose a novel yet simple localization technique, ASFALT, that improves the efficiency of the localization process by combining the simplicity of range-based schemes with the robustness of signature-based ones. Simulation experiments are conducted to verify the performance of the proposed algorithms.
Design of a two-level hot path detector for path-based loop optimizations
Authors: Takanobu Baba, Tomohisa Masuho, Takashi Yokota, Kanemitsu Ootsu
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Aggressive execution-path-based compiler and architecture optimizations require a path profiler that can specify several hottest paths at low overheads. Based on our observation that a limited number of paths are executed frequently in hot loops, we have designed a two-level hot path detector to specify such hottest paths within hot loops. The detector consists of two tables: a filter table and an accumulator table. The filter table captures the behavior of locally hot paths. This hot path information is then sent to the accumulator table to capture the behavior of globally hot paths. The path profiler also provides us with the information on hot loops as well as problematic instructions contained in the hot paths. They may be effectively utilized for the optimizations. We evaluate the profiler using SPEC CINT2000. The results show that the two-level organization has an effect of filtering out less frequent paths, and that the top 5 frequent paths and their order can be adequately detected.
A System-layer Infrastructure for SoC Diagnosis
Authors: P. Bernardi, M. Grosso, M. Rebaudengo, M. Sonza Reorda
Venue: Journal of Electronic Testing: Theory and Applications (2007)

During IC manufacturing phase, discriminating between good and faulty chips is not enough. In fact, especially in the first phase of the production of a new device, a complete understanding of the possible failures is quickly required to ramp up production yield. For test engineers, dealing with the manufacturing test of Systems-on-chip (SoCs) means to tackle the extraction of diagnostic data from faulty chips. Another equally important aim of diagnosis, in a later step of a product lifecycle, is to find the real root cause of silicon misbehaviors for field returns. At the core test layer, the adoption of diagnosis-oriented Design-for-Testability structures is almost mandatory and many solutions have been worked out for several types of cores; diagnosis data retrieval often consists in the execution of a set of self-test procedures whose application order and/or customization may depend on the obtained results themselves. This paper details the characteristics of a system-layer test architecture able to manage efficiently SoC self-diagnostic procedures. This architecture is composed of a diagnosis-oriented Test Access Mechanism (TAM) and an Infrastructure-IP owning enough intelligence to automatically manage core diagnostic procedures. Both of them have been designed in compliance with the IEEE 1500 Standard for Embedded Core Test and exploit the characteristics of Self-Test structures inserted for the diagnosis of memory, processor and logic cores. This approach to SoC diagnosis minimizes ATE memory requirements for pattern storage and drastically speeds up the complete execution of diagnostic procedures. Experimental results highlight the convenience of the approach with respect to alternative ATE driven diagnosis procedures, while resorting to negligible area overhead.
Software-Based Failure Detection and Recovery in Programmable Network Interfaces
Authors: Yizheng Zhou, Vijay Lakamraju, Israel Koren, C. M. Krishna
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Emerging network technologies have complex network interfaces that have renewed concerns about network reliability. In this paper, we present an effective low- verhead fault tolerance technique to recover from network interface failures. Failure detection is based on a software watchdog timer that detects network processor hangs and a self- esting scheme that detects interface failures other than processor hangs. The proposed self-testing scheme achieves failure detection by periodically directing the control flow to go through only active software modules in order to detect errors that affect instructions in the local memory of the network interface. Our failure recovery is achieved by restoring the state of the network interface using a small backup copy containing just the right amount of information required for complete recovery. The paper shows how this technique can be made to minimize the performance impact to the host system and be completely transparent to the user.
Fuzzy Rule Base Generation through Genetic Algorithms and Bayesian Classifiers A Comparative Approach
Authors: Marcos Evandro Cintra, Heloisa de Camargo, Estevan R. Hruschka, M. do Carmo Nicoletti
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The definition of the Fuzzy Rule Base is one of the most important and difficult tasks when designing Fuzzy Sys- tems. This paper discusses the results of two different hy- brid methods investigated earlier, for the automatic gener- ation of fuzzy rules from numerical data. One of the meth- ods proposes the creation of Fuzzy Rule Bases using ge- netic algorithms in association with a heuristic for prese- lecting candidate rules. The other, named BayesFuzzy, in- duces a Bayes Classifier using a dataset previously gran- ulated by fuzzy partitions and then translates this Classi- fier into a Fuzzy Rule Base. A comparative analysis be- tween both approaches focusing on their main character- istics, strengths/weaknesses and easiness of use is carried out. The reliability of both methods is also compared by analyzing their results in a few knowledge domains.
VR-based visual analytics of LIDAR data for cliff erosion assessment
Authors: Tung-Ju Hsieh, Michael J. Olsen, Elizabeth Johnstone, Adam P. Young, Neal Driscoll, Scott A. Ashford, Falko Kuester
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

The ability to explore, conceptualize and correlate spatial and temporal changes of topographical records, is needed for the development of new analytical models that capture the mechanisms contributing towards sea cliff erosion. This paper presents a VR-centric approach for cliff erosion assessment from light detection and ranging (LIDAR) data, including visualization techniques for the delineation, segmentation, and classification of features, change detection and annotation. Research findings are described in the context of a sea cliff failure observed in Solana Beach in San Diego county.
The Daikon system for dynamic detection of likely invariants
Authors: Michael D. Ernst, Jeff H. Perkins, Philip J. Guo, Stephen McCamant, Carlos Pacheco, Matthew S. Tschantz, Chen Xiao
Venue: Science of Computer Programming (2007)

Daikon is an implementation of dynamic detection of likely invariants; that is, the Daikon invariant detector reports likely program invariants. An invariant is a property that holds at a certain point or points in a program; these are often used in assert statements, documentation, and formal specifications. Examples include being constant (x=a), non-zero (x
A Dynamic Programming Technique for Classifying Trajectories
Authors: Simone Calderara, Rita Cucchiara, Andrea Prati
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper proposes the exploitation of a dynamic programming technique for efficiently comparing people trajectories adopting an encoding scheme that jointly takes into account both the direction and the velocity of movement. With this approach, each pair of trajectories in the training set is compared and the corresponding distance computed. Clustering is achieved by using the k-medoids algorithm and each cluster is modeled with a 1-D Gaussian over the distance from the medoid. A MAP framework is adopted for the testing phase. The reported results are encouraging.
An Energy Saving and Coverage Preserving Protocol based on Function Layers For Wireless Sensor Networks
Authors: Azzedine Boukerche, Xin Fei, Regina B. Araujo
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

To prolong the lifetime of wireless sensor networks, a duty cycle scheme is used in energy efficient coverage protocols. By turning off redundant sensors and waking them up when network coverage is jeopardized, the network lifetime is extended while network coverage is preserved. However, it was observed that when the network density is increased to further prolong lifetime, the lifetime increases more slowly than the increase in density. Based upon an analysis of energy usage and energy distribution of the original duty-cycle scheme, we present a new coverage protocol based on function layers that divides nodes into sensing and transmission virtual layers to change the distribution of energy usage in the different layers. The performance of our protocol was compared to the original duty-cycle scheme in terms of energy saving and network lifetime with a high coverage rate.
Searching customer patterns of mobile service using clustering and quantitative association rule
Authors: So Young Sohn, Yoonseong Kim
Venue: Expert Systems with Applications: An International Journal (2008)

This study presents the patterns of use for additional services that are currently provided to mobile telecommunication subscribers in Korea. Factor analysis, clustering and quantitative association rules are used to find the service adoption patterns of segmented groups. From the analysis, three types of user groups are identified. The first group consists of a new generation of customers who utilize chargeable additional services using the 'direct button', for leisure and entertainment. The younger generation use their mobile phones more frequently than the older generation, and tend to display higher usage patterns for a variety of additional services. The second group utilizes practical additional services that are low-priced or free such as 'data service' and 'phone-to-phone service' via 'Caller ID request service'. The customers in the final group are people who have no general usage characteristics. This paper utilizes the association rules found in each cluster to provide strategic guidance to enhance mobile service market of the corresponding group.
Finding hierarchical heavy hitters in data streams
Authors: Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Aggregation along hierarchies is a critical summary technique in a large variety of on-line applications including decision support and network management (e.g., IP clustering, denial-of-service attack monitoring). Despite the amount of recent study that has been dedicated to online aggregation on sets (e.g., quantiles, hot items), surprisingly little attention has been paid to summarizing hierarchical structure in stream data. The problem we study in this paper is that of finding Hierarchical Heavy Hitters (HHH): given a hierarchy and a fraction φ, we want to find all HHH nodes that have a total number of descendants in the data stream no smaller than φ of the total number of elements in the data stream, after discounting the descendant nodes that are HHH nodes. The resulting summary gives a topological "cartogram" of the hierarchical data. We present deterministic and randomized algorithms for finding HHHs, which builds upon existing techniques by incorporating the hierarchy into the algorithms. Our experiments demonstrate several factors of improvement in accuracy over the straightforward approach, which is due to making algorithms hierarchy-aware.
Some remarks on duality over a commutative ring
Authors: M. Di Loreto, J. F. Lafay, J. J. Loiseau
Venue: Mathematics and Computers in Simulation (2008)

This paper addresses the duality problem for dynamical, linear, time-invariant systems defined over a ring. The duality principle is at the core of theoretical results for systems defined over a field, but this principle can not be applied for systems over a ring. From the definition of controlled and conditioned invariant submodules in the geometric approach, we analyze the relationships among various notions of invariance, using the concept of orthogonal submodule. These logical relations are summarized in two non-equivalent schemes.
An Approach to the Diagnosis of Intermittent Faults
Authors: S. Kamal
Venue: IEEE Transactions on Computers (1975)

A procedure for the diagnosis of intermittent faults in combinational circuits is suggested. This procedure employs a probabilistic model for intermittent failures and presumes that a detection experiment has been run. The circuit is assumed to be irredundant and to possess a single fault out of n possible ones. The approach suggested is based on the repeated application of tests that test for these faults had their effect been permanent. A subset of the test set is selected and is repeatedly applied until a failure is observed. Similar subexperiments are then run with appropriate test subsets until the highest diagnostic resolution is obtained. The expected length of the diagnosis experiment is guaranteed to be finite. This is shown by proving that the expected length of each subexperiment is finite. The diagnosis experiment can be terminated, when any preset time limit is exceeded, compromising the obtained diagnostic resolution. Local symmetry of the fault table is found to be the necessary and sufficient condition for maximum diagnostic resolution.