ppxscal/embedding_network huggingface dataset:
Towards a Software Component Certification Framework
Authors: Alexandre Alvaro, Eduardo Santana de Almeida, Silvio Lemos Meira
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

The growing use of commercial components in large systems makes selection and evaluation of components an essential activity. Many organizations struggle in their attempts to select an appropriate component in their system. In this way, we propose a certification framework to evaluate the quality of software components in an efficient way. Keywords: Component Quality Model, Component Evaluation Techniques, Component Metrics Framework and Component Certification Process. Relevant Topics: Software Component Quality and Software Component Certification
Disruption-aware service composition and recovery in dynamic networking environments
Authors: Shanshan Jiang, Yuan Xue, Douglas Schmidt
Venue: Proceedings of the 2007 workshop on Automating service quality: Held at the International Conference on Automated Software Engineering (ASE) (2007)

The dynamic and heterogeneous natures of large-scale systems pose fundamental challenges to the design of service composition methods with minimum service disruptions. Improving reliability has long been a topic of extensive research in large-scale systems. Little existing work, however, has considered service deliveries spanning multiple components and taken both failure duration and frequency into account. This paper proposes a new service composition and recovery framework designed to achieve minimum service disruptions. The framework consists of two-tiers: service routing, which selects the service components, and network routing, which finds the network path that connects these service components. Our framework is based on a novel concept: disruption index, which characterizes different aspects of service disruptions, including frequency and duration. We formulate the problem of minimum-disruption service composition and recovery (MDSCR) as a dynamic programming problem and give its optimal solution under the assumption of complete knowledge of future failure distribution. We then present our MDSCR heuristic, which approximates the optimal solution with one-step lookahead prediction, where service link lifetime is predicted through statistical regression. We present the preliminary performance results of our algorithm via simulation study.
Oscillation Test Scheme of SC Biquad Filters Based on Internal Reconfiguration
Authors: Uroš Kač, Franc Novak
Venue: Journal of Electronic Testing: Theory and Applications (2007)

In this paper, we explore general conditions for the oscillation based test of switched-capacitor biquad filter stages. Expressions describing the characteristics of a filter stage put into oscillation are derived and conditions for achieving oscillation by internal transformation of the filter stage are explored. Reconfiguration scheme based on the transformation of the biquad filter stage to a quadratic oscillator is studied. Theoretically the circuit can be put into oscillation by de-activating a single capacitor. Simulations, however, show that in practice a carefully designed low feed-back loop is required to achieve acceptable oscillation test mode.
Special Feature: Software Maintainability: A Practical Concern for Life-Cycle Costs
Authors: J. B. Munson
Venue: Computer (1981)

Software modifiability doesn't just happen. It must be designed, tested, and paid for just like any other software requirement.
A Guidance for Model Composition
Authors: Kleinner S. F. Oliveira, Toacy Cavalcante de Oliveira
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

With the advent of the Model Driven Development (MDD), models are replacing code as the major artifact in software development. These models are typically specified using OMG's Unified Modeling Language (UML) . In MDD, model transformation and model composition are two essential model management tasks. Model transformation has been extensively researched while model composition still needs further investigation. The goal of this paper is to propose a guidance for model composition (specifically for class diagrams composition) based on match rules, model transformation rules and model composition strategy. Moreover, we present UML Profile for Model Composition and make an analysis about UML's composition mechanism.
Stop-and-restart style execution for long running decision support queries
Authors: Surajit Chaudhuri, Raghav Kaushik, Abhijit Pol, Ravi Ramamurthy
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Long running decision support queries can be resource intensive and often lead to resource contention in data warehousing systems. Today, the only real option available to the DBAs when faced with such contention is to carefully select one or more queries and terminate them. However, the work done by such terminated queries is entirely lost even if they were very close to completion and these queries will need to be run in their entirety at a later time. In this paper, we show how instead we can support a Stop-and-Restart style query execution that can leverage partially the work done in the initial query execution. In order to re-execute only the remaining work of the query, a Stop-and-Restart execution would need to save all the previous work. But this approach would clearly incur high overheads which is undesirable. In contrast, we present a technique that can be used to save information selectively from the past execution so that the overhead can be bounded. Despite saving only limited information, our technique is able to reduce the running time of the restarted queries substantially. We show the effectiveness of our approach using real and benchmark data.
Mobile Radio Network Planning Aspects
Authors: Yufei Wu, Samuel Pierre
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

during planning phase of 3G networks. Some of the most important factors are: quality of service (QoS), cost of implementation and provisioning, traffic coverage ratio, and resource utilization. This paper analyzes planning aspects of 3G mobile radio network deployment and proposes optimization models which explicitly take into account some important factors such as QoS and power control. It also proposes a tabu search algorithm to solve the overall planning problem considered as NP-hard. Computational experiments with realistic problem sizes are conducted to describe some important aspects of efficient 3G deployment, and show both the efficiency and the practicality of the tabu search algorithm. Index Terms--3G, Mobile network planning and optimization, NP-hard, Tabu Search
An Evaluation of MLP Neural Network Efficiency for Image Filtering
Authors: Raquel E. Patino-Escarcina, Jose Alfredo F. Costa
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Digital images have been widely used in a diversity of areas. The processes of digitalization and transmission of images may reduce its visual quality. Many recent pub- lications include different tools to improve the quality of these images such as filters that reduce the noise within the images. Neural networks, such as Multilayer Perceptrons (MLP), have been widely studied as efficient tools for ar- bitrary function approximation. This paper describes the usage of MLP working as filters for images. More specifi- cally, the work deals with the reduction of impulsive noise in images and describe conditions to obtain efficient results in comparison with the traditional filters. A simply method to evaluate the efficiency of filters is described. The factor con- siders not only the ability of the filter in restoring noisy pix- els but also the effects that may occur in original (noiseless) pixels, such as blurring, that degrades the images. Exper- iments were conducted for traditional filters, such as mean and median, and MLP networks with increasing presence of noise within the training data. Results shown a better overall efficiency for MLP networks trained with images de- graded with a small percent of impulsive noise.
Photonic NoC for DMA Communications in Chip Multiprocessors
Authors: Assaf Shacham, Benjamin G. Lee, Aleksandr Biberman, Keren Bergman, Luca P. Carloni
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

As multicore architectures prevail in modern highperformance processor chip design, the communications bottleneck has begun to penetrate on-chip interconnects. With vastly growing numbers of cores and on-chip computation, a high-bandwidth, low-latency, and, perhaps most importantly, low-power communication infrastructure is critically required for next generation chip multiprocessors. Recent remarkable advances in silicon photonics and the integration of photonic elements with standard CMOS processes suggest the use of photonic networks-on-chip. In this paper we review the previously proposed architecture of a hybrid electronic/photonic NoC.We improve the former internally blocking switches by designing a non-blocking photonic switch, and we estimate the optical loss budget and area requirements of a practical NoC implementation based on the new switches. Additionally, we tackle one of the key performance challenges: the latency associated with setting-up photonic paths. Simulations show that the technique suggested can substantially reduce the latency and increase the effective bandwidth. Finally, we consider the DMA communication model in the context of the photonic network and evaluate the optimal DMA block size.
DFA Mechanism on the AES Key Schedule
Authors: Junko Takahashi, Toshinori Fukunaga, Kimihiro Yamakoshi
Venue: Proceedings of the Workshop on Fault Diagnosis and Tolerance in Cryptography (2007)

This paper describes a DFA (Differential Fault Analysis) mechanism on the AES key scheduling process and shows how an entire 128-bit AES key can be retrieved. We make a detailed analysis of the DFA mechanism on the AES key schedule and propose general attack rules. As a result of reconsidering the best attack approach on the basis of analysis, we present a more efficient attack than the previous one. We show that we can retrieve an entire 128-bit AES key using 2-pairs of correct and faulty ciphertexts with a 48-bit brute-force search, 4-pairs of them with a 16-bit brute-force search and 7-pairs of them without brute-force search. These steps are enough to calculate the key with feasible computation resources.
Local Scale for Boundary Shape Description: Application in Locating Landmarks Automatically
Authors: Sylvia Rueda, Jayaram K. Udupa, Li Bai
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

A good shape descriptor is necessary for automatically identifying landmarks on boundaries. Our method of boundary shape description is based on the notion of cscale, which is a new local scale concept, defined at each boundary element. From this representation we can extract special points of interest such as convex and concave corners, straight lines, circular segments, and inflection points. The results show that this method gives a complete description of shape and allows the automatic positioning of mathematical landmarks, which agree with our intuitive ideas of where landmarks may be defined. This method is applicable to spaces of any dimensionality, although we have focused in this paper on 2D shapes.
A Log Analysis Audit Model Based on Optimized Clustering Algorithm
Authors: Hui Yu, Xingjian Shi
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

In view of the problem how to detect the network unknown attacks, a security log analysis audit model based on optimized clustering algorithm is proposed in this paper. Since the main question which influence the clustering algorithm application in the log analysis is uneasy to determine the network attack type and the cluster number, so we bring forward an optimized cluster algorithm to solve this problem. By means of simulated experiments, this algorithm is proved feasible, efficient and extensible for unknown intrusion detection.
Geographic co-occurrence as a tool for gir.
Authors: Simon E. Overell, Stefan Rüger
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

In this paper we describe the development of a geographic co-occurrence model and how it can be applied to geographic information retrieval. The model consists of mining co-occurrences of placenames from Wikipedia, and then mapping these placenames to locations in the Getty Thesaurus of Geographical Names. We begin by quantifying the accuracy of our model and compute theoretical bounds for the accuracy achievable when applied to placename disambiguation in free text. We conclude with a discussion of the improvement such a model could provide for placename disambiguation and geographic relevance ranking over traditional methods.
Simulating competitive interactions using singly captured motions
Authors: Hubert P. H. Shum, Taku Komura, Shuntaro Yamazaki
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

It is difficult to create scenes where multiple avatars are fighting / competing with each other. Manually creating the motions of avatars is time consuming due to the correlation of the movements between the avatars. Capturing the motions of multiple avatars is also difficult as it requires a huge amount of post-processing. In this paper, we propose a new method to generate a realistic scene of avatars densely interacting in a competitive environment. The motions of the avatars are considered to be captured individually, which will increase the easiness of obtaining the data. We propose a new algorithm called the temporal expansion approach which maps the continuous time action plan to a discrete space such that turn-based evaluation methods can be used. As a result, many mature algorithms in game such as the min-max search and &alpha;---&beta; pruning can be applied. Using our method, avatars will plan their strategies taking into account the reaction of the opponent. Fighting scenes with multiple avatars are generated to demonstrate the effectiveness of our algorithm. The proposed method can also be applied to other kinds of continuous activities that require strategy planning such as sport games.
Characterization of Online Auctions: Correlating Negotiation Patterns and Bidding Behavior
Authors: A. Pereira, L. Rocha, F. Mourao, W. Meira Jr., P. Goes
Venue: Proceedings of the 2007 Latin American Web Conference (2007)

Online auctions have become a major electronic commerce channel in terms of revenue, reaching an enormous and very diverse population of participants all over the world. Modeling the factors that drive the dynamics of an auction, that is, the interactions that happen during its negotiation, is crucial to improve the customer experience for both sellers and buyers. Auction dynamics can be seen as complex and non-isolated interactions, where successive interactions become a 1oopTfeedback mechanism. In what we call reactivity, the user behavior affects the auction negotiation and vice-versa. In this work, we develop a characterization approach for online auctions to capture the reactivity concept. Using the characterization, we are able to model both auction negotiation patterns and bidding behavior and correlate them. Our approach is novel, and the results start to shed light into measuring reactivity in online auctions. Our aim is to explain how the auction negotiation affects the bidders' behavior and vice-versa, and to relate the correlation auction pattern - bidding behavior to outcome measures.
A Method for Representing Data Items of Unlimited Length in a Computer Memory
Authors: R. L. Baber
Venue: IEEE Transactions on Software Engineering (1981)

In this paper, a recursive data structure is defined which permits a data item of-unlimited length to be represented in a computer memory. The encoded data are a linear string of symbols which contains a specification of the length of the data item and the data item itself. In a single forward scan of the encoded data string, the length of the data item can be determined and the data item located and/or extracted.
Dynamic Software Adaptation with Dependence Analysis for Multi-Agent Platform
Authors: Seungwok Han, Sung Keun Song, Hee Yong Youn
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Modern software system is required to be flexible and adaptable to deal with dynamic environment. To address this new requirement, meta-level architecture description-based dynamic software adaptation has been proposed, which refers to the software system changing its structure and behavior at runtime without user intervention. In this paper we propose an approach for multi-agent system offering dynamic agent adaptation by runtime reconfiguration. The proposed runtime agent adaptation process employs the matrix-based dependence analysis model to check if the performance requirement is satisfied by the reconfiguration. It will thus simplify the development, deployment, and maintenance of the system using the adaptation facilities. An agent platform employing the proposed approach has been implemented, which complies with the FIPA specification.
Design and Implementation of a Network Aware Object-based Tape Device
Authors: Dingshan He, Nagapramod Mandagere, David Du
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

Data storage requirements have constantly evolved over time. In recent times, the rate of increase in volume of data has been exponential, partly because of regulations and partly because of increase in richness of data. This trend has led to an equally explosive increase in cost of management. Intelligent Storage Devices built using Objectbased Storage (OSD) Interfaces have gained increased acceptance due to the benefits of reduced management costs. The command set of the current OSD standard does not work well with tape-based storage solutions. In this work we propose a few extensions to the OSD standard in order to facilitate easier integration of tape devices into the object storage ecosystem. Further, we propose an intelligent buffering mechanism to maximize the utility of network attached tape devices, and we also propose mechanisms to make tape cartridges more portable within any object storage ecosystem. Our results for the intelligent buffering mechanism show that our scheme adapts better to mismatches in network and tape drive bandwidths. Specifically, our scheme helps minimize the repositioning of the tape, leading to better utilization and increased lifetime of the tape.
Courseware Authoring Tool for Achieving Interoperability among Various E-Learning Specifications Based on Web 2.0 Technologies
Authors: Te-Hua Wang, Neil Y. Yen, Yue-Lin Du, Timothy K. Shih
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

With the trend of the Internet applications, e- Learning has shown its significance along with various learning activities in more convenient ways. Followed by this tendency, many well-known e-learning specifications were proposed to regulate those digitalized learning activities in a standardized manner. However, with respect to the interoperability among various e-learning specifications nowadays, some of them were designed to support particular domains. And this will lead to the result of poor shareability of existing learning resources. On the other hand, the courseware authoring could be considered as the fundamental process while realizing an e-learning environment. As a result, the applicable scope and the user-friendliness should be taken into account for supporting efficient learning contents development. In this paper, we will like to propose a courseware authoring tool to achieve the interpretability among different e-learning specifications based on Web 2.0 technologies in an efficient way.
Geomap-III: Designing Solids With Free-Form Surfaces
Authors: Fumihiko Kimura
Venue: IEEE Computer Graphics and Applications (1984)

In advanced CAD/CAM applications, designers need the capability of modeling solid objects with complex surfaces. This geometric modeler incoroorates new techniques to combine design functions.
Calculation of surface energy associated with formation of multiple kinked cracks
Authors: J. H. Chang, W. H. Wu
Venue: Computers and Structures (2007)

An energy parameter termed M"c is proposed for calculation of the surface energy associated with formation of multiple kinked cracks in 2-D anisotropic elastic solids. The formulation is based on a path-independent contour integral. The surface energy can be exactly evaluated by M"c when the cracked solids are homogeneously-stressed (i.e., the material characteristic), and effectively approximated when the solids are nonhomogeneously-stressed (i.e., the structural characteristic). It is thus suggested that M"c be possibly used as a fracture parameter that quantitatively measures the degradation of material (e.g. in micromechanics) and/or structural integrity due to irreversible evolution of multiple kinked cracks.