ppxscal/embedding_network huggingface dataset:
Efficient solving of structural constraints
Authors: Bassem Elkarablieh, Darko Marinov, Sarfraz Khurshid
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

Structural constraint solving is being increasingly used for software reliability tasks such as systematic testing or error recovery. For example, the Korat algorithm provides constraint-based test generation: given a Java predicate that describes desired input constraints and a bound on the input size, Korat systematically searches the bounded input space of the predicate to generate all inputs that satisfy the constraints. As another example, the STARC tool uses a constraint-based search to repair broken data structures. A key issue for these approaches is the efficiency of search. This paper presents a novel approach that significantly improves the efficiency of structural constraint solvers. Specifically, most existing approaches use backtracking through code re-execution to explore their search space. In contrast, our approach performs checkpoint-based backtracking by storing partial program states and performing abstract undo operations. The heart of our approach is a light-weight search that is performed purely through code instrumentation. The experimental results on Korat and STARC for generating and repairing a set of complex data structures show an order to two orders of magnitude speed-up over the traditionally used searches.
Visual Basic 2008 Recipes: A Problem-Solution Approach (Recipes a Problem-Solution Approach)
Authors: Todd Herman, Allen Jones, Matthew MacDonald, Rakesh Rajan
Venue:  (2008)

Sometimes you just need to solve a problem and get on with your work. To that end, Visual Basic 2008 Recipes is a compendium of practical solutions for busy VB .NET programmers. Create time for the more interesting aspects of your VB .NET project by solving common problems with the practical solutions and dozens of code examples in this book. Important new .NET 3.5 technologies, such as Windows Presentation Framework (WPF) and Language Integrated Query (LINQ), are covered, and each chapter addresses a specific problem domain, including database access, multimedia, XML manipulation, networking, and security. The code is free to download so you can use the recipes immediately. Take advantage of quality, readymade solutions to common Visual Basic programming problems. Avoid the tedium of having to reinvent the wheel. Focus instead on the more interesting problems specific to your application. Learn from and be inspired by what the authors have done. Use their work as stepping stones to solve even more complex problems. What youll learn Cleanly separate userinterface logic from business logic through the use of .NET 3.5s WPF. Store data to and retrieve data from your relational database using LINQ. Manipulate XML data using LINQ. Make your programs dynamically configurable through the judicious application of reflection. Take advantage of multiple CPU cores by writing multithreaded applications. Integrate multimedia into your Visual Basic projects. Who is this book for? Visual Basic 2008 Recipes is written for Visual Basic developers who have at least some experience in developing Visual Basic solutions. The book contains recipes appealing to intermediate through advanced developers. Related Titles Accelerated VB 2008 Microsoft SharePoint: Building Office 2007 Solutions in VB 2005 Beginning Object-Oriented Programming with VB 2005: From Novice to Professional
Capturing business benefits from process improvement: four fallacies and what to do about them
Authors: Paul L. Bannerman
Venue: Proceedings of the 1st international workshop on Business impact of process improvements (2008)

A basic assumption underlying any process improvement initiative is that it will have a positive impact on the organization. Therefore, it can become easy to assume that process change will in fact deliver benefits to business. This paper takes a practice-based look at some fundamental assumptions about process improvement that can be as fallacious as they can be true. The argument is supported by case scenarios. Also, some ways are suggested to manage around these fallacies to achieve net benefits rather than no impact or negative impacts on the business. Four basic fallacies are considered: that process improvement leads to business improvement; that process change equates to process improvement; that software processes are non-lethal; and the vision of the enterprise as an automated process. The paper concludes that the future success of process improvement as a management strategy is dependent upon the capability of organizations to capture material gains.
Evaluating the emotional content of human motions on real and virtual characters
Authors: Rachel McDonnell, Sophie Jörg, Joanna McHugh, Fiona Newell, Carol O'Sullivan
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

In order to analyze the emotional content of motions portrayed by different characters, we created real and virtual replicas of an actor exhibiting six basic emotions: sadness, happiness, surprise, fear, anger and disgust. In addition to the video of the real actor, his actions were applied to five virtual body shapes: a low and high resolution virtual counterpart, a cartoon-like character, a wooden mannequin, and a zombie-like character (Figure 1). Participants were asked to rate the actions based on a list of 41 more complex emotions. We found that the perception of emotional actions is highly robust and to the most part independent of the character's body.
Preparation and Microstructural Characterization of Al2O3/ZrO2 Nanocomposites to Use in the Femoral Head of Hip Replacement
Authors: Gang Zhou, Soo Wohn Lee, Yubao Li
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

High-purity aluminum oxide is potentially an attractive implante material for total hip joint replacement, because its biocompatibility, excellent wear resistance, high strength and corrosion resistance. The main problem of alumina is relatively low fracture toughness. Thus, this study is the introduction of ZrO2 as second ceramic phase homogeneously dispersed wihtin an alumina matix. Al2O3/ZrO2 nanocomposites disk is prepared by spark plasma sintering(SPS) method at 1500°C and 50MPa, in vacuum for 5min. Then, X-ray diffraction (XRD) and scanning electron microscopy (SEM) were used to analyze the microstucture and phases of this nanocomposite. Moreover, frexual sthrength of the nanocomposites was meausured as well as hardness and fracture toughness. When the content of ZrO2 is up to 15wt%, the fracture toughness value (8.4MPam1/2), and strength (527MPa) are achieved. This Al2O3/ZrO2 nanocomposites may be served as a tatal hip joint replacement.
A Non-Intrusive Approach to Enhance Legacy Embedded Control Systems with Cyber Protection Features
Authors: Shangping Ren, Kevin Kwiat
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Unlike general purpose systems, distributed and embedded control systems, such as power grid control systems and water treatment systems, etc., generally have a 24x7 availability requirement. Hence, upgrading or adding new cyber protection features into these systems in order to sustain them when faults caused by cyber attacks occur, is often difficult to achieve and inhibits the evolution of these systems into a cyber environment. In this paper, we present a solution for extending the capabilities of existing systems while simultaneously maintaining the stability of the current systems. An externalized survivability management scheme based on the observe-reason-modify paradigm is applied, which decomposes the cyber attack protection process into three orthogonal subtasks: observation, evaluation and protection. This architecture provides greater flexibility and has an evolvability attribute - it can utilize emerging techniques; yet requires either minimal modifications or even no modifications whatsoever to the controlled infrastructures. The approach itself is general and can be applied to a broad class of observable systems.
Statistical techniques for detecting traffic anomalies through packet header data
Authors: Seong Soo Kim, A. L. Narasimha Reddy
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

This paper proposes a traffic anomaly detector, operated in postmortem and in real-time, by passively monitoring packet headers of traffic. The frequent attacks on network infrastructure, using various forms of denial of service attacks, have led to an increased need for developing techniques for analyzing network traffic. If efficient analysis tools were available, it could become possible to detect the attacks, anomalies and to take action to contain the attacks appropriately before they have had time to propagate across the network. In this paper, we suggest a technique for traffic anomaly detection based on analyzing correlation of destination IP addresses in outgoing traffic at an egress router. This address correlation data are transformed using discrete wavelet transform for effective detection of anomalies through statistical analysis. Results from trace-driven evaluation suggest that proposed approach could provide an effective means of detecting anomalies close to the source. We also present a multidimensional indicator using the correlation of port numbers and the number of flows as a means of detecting anomalies.
A phase transition for the metric distortion of percolation on the hypercube
Authors: Omer Angel, Itai Benjamini
Venue: Combinatorica (2007)

Let H n be the hypercube {0, 1} n , and denote by H n,p Bernoulli bond percolation on H n , with parameter p = n &#x2212;&#x03b1; . It is shown that at &#x03b1; = 1/2 there is a phase transition for the metric distortion between H n and H n,p . For &#x03b1; < 1/2, the giant component of H n,p is likely to be quasi-isometric to H n with constant distortion (depending only on &#x03b1;). For 1/2 < &#x03b1; < 1 the minimal distortion tends to infinity as a power of n. We argue that the phase 1/2 < &#x03b1; < 1 is an analogue of the non-uniqueness phase appearing in percolation on non-amenable graphs.
Synchroscalar: Evaluation of an embedded, multi-core architecture for media applications
Authors: John Oliver, Ravishankar Rao, Diana Franklin, Frederic T. Chong, Venkatesh Akella
Venue: Journal of Embedded Computing (2006)

We present an overview of the Synchroscalar single-chip, multi-core processor. Through the design of Synchroscalar, we find that high energy efficiency and low complexity can be attained through parallelization. The importance of adequate inter-core interconnect is also demonstrated. We discuss the impact of having multiple frequency and voltage domains on chip to reduce the power consumption where parallelization fails. Finally, we investigate how the ad-hoc selection of tile size that is currently used in most single-chip multi-core processors impacts the power consumption of these architectures.
Architectural Concurrency Equivalence with Chaotic Models
Authors: Dionisio de Niz
Venue: Proceedings of the 2008 5th International Workshop on Model-based Methodologies for Pervasive and Embedded Software (2008)

During its lifetime, embedded systems go through multiplechanges to their runtime architecture. That is, threads,processes, and processor are added or removed to/from thesoftware and hardware. These additions can have multiplemotivations such as adding tolerance to failures or changesin the hardware architecture for new releases of the system.During these modifications, one of the big challenges is ensuringthat no new error is introduced. This verificationtends to be difficult given that modifying the concurrencystructure of an application has multiple side effects difficultto discover. In this paper we propose a model-based techniqueto compare the concurrency structures of two architecturalmodels.This exhaustive comparison is based on thesemantics of AADL, an architecture description language,and its model in Alloy, a formal verification language. Thisverification guides the designer to fully define the desiredbehaviors as well as the side effects that can be tolerated.We demonstrate the use of the modeling with a simple modelfrom the automotive industry.
A study of query length
Authors: Avi Arampatzis, Jaap Kamps
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We analyse query length, and fit power-law and Poisson distributions to four different query sets. We provide a practical model for query length, based on the truncation of a Poisson distribution for short queries and a power-law distribution for longer queries, that better fits real query length distributions than earlier proposals.
Solutions to the WLAN and Bluetooth Interference
Authors: Mah-Rukh Fida
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This review paper discusses the interference problem generated by using Bluetooth and WLAN in close proximity. The paper gives out the solutions proposed and implemented to mitigate this interference.
A Methodology for Automated Vector-to-Image Registration
Authors: Peter Doucette, Boris Kovalerchuk, Robert Brigantic, Gamal Seedahmed, Brian Graff
Venue: Proceedings of the 36th Applied Imagery Pattern Recognition Workshop (2007)

Registration and alignment of feature (e.g., vector) and raster geospatial data is a difficult and time consuming process when performed manually. This paper presents an approach for vector-to-raster registration. Candidate features are auto-extracted and vectorized from imagery, which are the basis to compare against existing vector layer(s) to be registered. Given that automated feature extraction (AFE) methods are imperfect, the objective is to determine and gather a sufficient signal-to-noise ratio from AFE upon which to base a registration process between vector data sets. Two vector registration methods were investigated. The first is based on an algebraic structural algorithm (ASA) in which structural components (e.g., angles, lengths and areas) are used as similarity metrics. The second is based on a similarity transformation of local features (STLF) in which a 4-parameter transformation is used to align features on a local basis. Experiments were performed to register road vector data to commercial panchromatic and multispectral Quick Bird imagery.
Personal information search on mobile devices
Authors: Mehmet Akbas, Gurminder Singh
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)

The more things can be saved and done with mobile phones, the more it becomes difficult to find what you are looking for. It was easy when one just saved phone numbers with names of friends, but as the devices have become more resourceful, their usage has expanded enormously. Today's mobile phones are comparable in compute capability and storage to the desktop computers of a decade ago. Consequently, searching and reaching the desired content on a mobile phone has been become an important function. Users and businesses are more dependent on mobile devices than ever before. Managing information scattered across multiple devices is becoming a big problem. We present a system for efficiently and conveniently searching through personal information stored on multiple mobile devices.
Dual-scale approach for detection of tsunami-affected areas using optical satellite images
Authors: T. T. Vu, M. Matsuoka, F. Yamazaki
Venue: International Journal of Remote Sensing (2007)

As various sensors with different spatial resolutions, spectral resolutions, etc., have been in operation, an extremely large image database is ready. How to retrieve the relevant information is a critical problem in the context of quick damage assessment. This study develops a framework to integrate medium resolution (Landsat or ASTER) and high-resolution (QuickBird or IKONOS) satellite images and digital elevation data in mapping tsunami-affected areas. The processing flows upwards from macro-scale (medium spatial resolution data) to micro-scale (high spatial resolution data). Across this pyramidal searching, only necessary data is acquired, processed and the focused geographical extent is narrowed. Suitable pixel-based and object-based processing methods are also developed. Using the developed processing flow drastically reduces acquisition cost and processing time. The selected test sites in Phangnga and Phuket Provinces, Thailand, which were severely affected by the 2004 Indian Ocean tsunami, are used to demonstrate the performance of the framework. Further studies include the implementation of the processing system and the extension of the idea to other natural hazards.
Task Parallelism for Object Oriented Programs
Authors: Nasser Giacaman, Oliver Sinnen
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Parallel computing is notoriously challenging due to the difficulty in developing correct and efficient programs. With the arrival of multi-core processors for desktop systems, desktop applications must now be parallelised. However achieving task parallelism for such object-oriented programs has traditionally been, and still remains, difficult. This paper presents a powerful task concept for parallel object-oriented programming and presents the results from a source-to-source compiler and runtime system. With the addition of a single keyword, the sequential code does not require restructuring and asynchronous task management is performed on behalf of the programmer; the parallel code required to realise task parallelism looks very much like the sequential counterpart. An intuitive solution is provided to handle task dependencies as well as integrating different task concepts into one model.
Authentication for WiFi - WiBbro-based BWAN interworking
Authors: Yong Lee, Goo Yeon Lee
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

In this paper, we solve the interworking problem for different user authentications between licensed BWAN and unlicensed band network when an unlicensed radio band user connects to the Internet via BWAN.
Construction of concrete verification models from C++
Authors: Malay Haldar, Gagandeep Singh, Saurabh Prabhakar, Basant Dwivedi, Antara Ghosh
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

C++ based verification methodologies are now emerging as the preferred method for SOC design. However most of the verification involving the C++ models are simulation based. The challenge of using C++ for sequential equivalence checking comes from two aspects (1) Language constructs such as pointers, polymorphism, virtual methods, dynamic memory allocation, dynamic loop bounds, floating points pose difficulty in creating a model suitable for equivalence checking (2) The memory and runtime required for creating models suitable for equivalence checking from practical C++ designs is huge. In this paper we describe techniques for constructing verification models from C++ designs containing a very rich set of language constructs. The flow is built keeping in mind that formal methods are inherently capacity constrained but need to be applied to large C++ designs to have practical value.
Automatic generated clients of grid services for computational fluid dynamics
Authors: Dana Petcu
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Several recent tools are available to encapsulate and execute complex applications as Grid services, but few ones are providing also a way for an application developer to generate an application specific interface. This paper describes a package for automatic generation of client codes from Grid service descriptions. Its usefulness is analyzed in the context of accessing legacy codes for computational fluid dynamics deployed as Grid services.
A 1-V piecewise curvature-corrected CMOS bandgap reference
Authors: Jing-hu Li, Yu-nan Fu, Yong-sheng Wang
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

A 1-V piecewise curvature-corrected CMOS bandgap reference (BGR) is proposed. It features in utilizing piecewise corrected current to a conventional first-order current-mode BGR. The corrected current is zero, exponential with temperature and proportional to the squared temperature in the lower, middle and upper temperature range (TR). Simulated results indicate that proposed BGR achieves temperature coefficient (TC) of 1.18ppm/°C in the TR of -30-130°C, power supply rejection ratio (PSRR) of -52dB and line regulation of 0.1mV/V in the supply range of 1-1.8V. The maximum power consumption is 29.5¼W. It is designed in HJTC 0.18-¼m n-well CMOS process.
Contextualized Linguistic Matching for Heterogeneous Data Source Integration
Authors: Youssef Bououlid Idrissi, Julie Vachon
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

As one can expect, members of a common market are likely to work in quite different domains and use different kinds of schemas to describe their own business data. An ideal world would allow such heterogeneous data to be integrated into some (concrete or virtual) business data repository. It seems illusory to think that all members joining a common marketplace can directly provide data adhering to some predefined federative data scheme (e.g. standard ontology). More flexibility is usually required. Realistically, the integration of a new data source requires a mapping step allowing to compute semantic equivalences between the various schema concepts to be merged. This task can be alleviated by the use of semi-automatic mapping tools which evaluate semantic similarities between concepts. Most of these mapping systems currently rely on linguistic matching and are not so efficient when dealing with highly heterogeneous data sources. Some of them refer to general purpose dictionaries not taking into account the specificity of data sources' domain. To better cope with data source heterogeneity, this article presents Indigo, a system which can compute semantic matching by taking into account data sources' context. The distinctive feature of Indigo is to enrich data sources with semantic information extracted from their individual development artifacts. Thanks to this enrichment step, Indigo can then compute a more accurate mapping between the two data sources thus enhanced. Indigo was experimented on two case studies presented in this paper. Indigo's performances are also compared to the results of three matching systems often cited in this research domain.
Reliable cut-through forwarding in CDMA inter-vehicle networks
Authors: Oyunchimeg Shagdar, Suhua Tang, Mehdad N. Shirazi, Ryutaro Suzuki, Sadao Obana
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

In inter-vehicle networks, it is required that collision warning messages be forwarded over multiple hops with significantly short delay. Cut-through packet forwarding is known to effectively reduce forwarding latency. However, it suffers from reliability issue, which can be severe in wireless networks, due to fading, users' mobility, and so on. This paper tries to establish a reliable cut-through forwarding method by applying diversity combining scheme for collision warning messages. By exploiting the nature of the multi-hop forwarding of a broadcast packet in an CDMA network, the diversity combining scheme does not incur any additional communication overhead or delay. The simulation results show that proposed scheme can reduce BER of the conventional scheme by at least 2 orders of magnitude.