ppxscal/embedding_network huggingface dataset:
A Distributed Service Discovery Architecture for Pervasive Environments
Authors: Siva Subramani, Niranjan Dhanakoti, Srividya Gopalan, V. Sridhar
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

A growing number of inexpensive portable computing devices are becoming available that can access data and media services across heterogeneous networks and network standards. Concurrently, significant computational resources are being deployed offering diverse and innovative services to users of these networks. In such type of a pervasive environment, one of the critical issues for a mobile user would be locating an appropriate network, discovering and selecting appropriate services. In recognition of this, we propose a novel Distributed Service Discovery Architecture that consists of Service Clustered Servers (SCS) distributed across the network and form a Service Overlay Network (SoN) to provide seamless service discovery and access. The architecture is extended to address wide area service using multi-tier model with facilitators. The real time implementation of architecture is performed and parameters such as latency to find a service, precision, CBR and gain in wide area networks are measured and discussed.
Phase Change Memory Faults
Authors: M. Jagadesh Kumar, Ali A. Orouji
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Using two-dimensional simulation, we report a new Gate-induced Barrier Field Effect Transistor (GBFET) which exhibits at least three orders of magnitude less OFF state leakage current when compared to a conventional poly-Si TFT. We demonstrate that the GBFET is completely free of pseudo-subthreshold conduction making it a very attractive device for active matrix liquid crystal display systems.
Experimental performance analysis of ada programs in cluster system
Authors: Korochkin Alexandr, Salah Imad, Korochkin Dmitry
Venue: ACM SIGAda Ada Letters (2005)

In this paper, we describe the use of the Ada language for programming in modern cluster systems. The results of experimental performance analysis of Ada and Java programs in a real cluster systems based on dual SMP nodes are presented.
NFRs-aware architectural evolution of component-based software
Authors: Chouki Tibermacine, Régis Fleurquin, Salah Sadou
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

During software maintenance, some non-functional properties may be lost. This is due to the lack of an explicit definition of their links with the corresponding architectural choices. In this paper, we present a solution that automates the checking of non-functional properties after the evolution of a component-based software. Our approach emphasizes the interest of formally documenting the links binding non-functional requirements to architectural choices. The proposed formalism is based on the Object Constraint Language (OCL) applied to a software component metamodel. We also present a prototype tool which uses this documentation to warn the developer of possible effects of an architectural change on non-functional requirements.
Error Analysis of the Quasi-Gram--Schmidt Algorithm
Authors: G. W. Stewart
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

Let the $n\,{\times}\,p$ $(n\geq p)$ matrix $X$ have the QR factorization $X = QR$, where $R$ is an upper triangular matrix of order $p$ and $Q$ is orthonormal. This widely used decomposition has the drawback that $Q$ is not generally sparse even when $X$ is. One cure is to discard $Q$, retaining only $X$ and $R$. Products like $a = Q\trp y = R\itp X\trp y$ can then be formed by computing $b = X\trp y$ and solving the system $R\trp a = b$. This approach can be used to modify the Gram--Schmidt algorithm for computing $Q$ and $R$ to compute $R$ without forming $Q$ or altering $X$. Unfortunately, this quasi-Gram--Schmidt algorithm can produce inaccurate results. In this paper it is shown that with reorthogonalization the inaccuracies are bounded under certain natural conditions.
P2P-Based Grid Architecture for Homology Searching
Authors: Hiroshi Sunaga, Toshiyuki Oka, Kiyoshi Ueda, Hiroaki Matsumura
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

This paper describes an advanced Grid architecture efficient for homology searching in bioinformatics. An integrated architecture of the computing-grid and data-grid through P2P communication attains efficient job processing. Field trials, in which broadband users and bioinformatics researchers participated to find new DNAs, show its effectiveness in reducing processing time.
On the Use of Specification-Based Assertions as Test Oracles
Authors: David Coppit, Jennifer M. Haddox-Schatz
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

The "oracle problem" is a well-known challenge for software testing. Without some means of automatically computing the correct answer for test cases, testers must instead compute the results by hand, or use a previous version of the software. In this paper, we investigate the feasibility of revealing software faults by augmenting the code with complete, specification-based assertions. Our evaluation method is to (1) develop a formal specification, (2) translate this specification into assertions, (3) inject or identify existing faults, and (4) for each version of the assertion-enhanced system containing a fault, execute it using a set of test inputs and check for assertion violations. Our goal is to determine whether specification-based assertions are a viable method of revealing faults, and to begin to assess the extent to which their cost-effectiveness can be improved. Our evaluation is based on two case studies involving real-world software systems. Our results indicate that specification-based assertions can effectively reveal faults, as long as they adversely affect the program state. We describe techniques that we used for translating high-level specifications into code-level assertions. We also discuss the costs associated with the approach, and potential techniques for reducing these costs.
Investigating human factors issues in the data mining processes
Authors: Colin G. Drury
Venue:  (2005)

In our information age, a rapidly widening gap between data collection/storage capabilities and the ability to analyze the data has eliminated the feasibility of traditional data analysis approaches. The root of the problem has been identified as data size and its dimensionality (Fayyad, Haussler, Stolorz, 1996). Data Mining (DM) has become part of the technological response to this issue. The promise of DM into find any interesting patterns hidden in these gigabytes of data and present the extracted high-level information to the analyst or decision-maker. Despite the fact that human involvement in DM tasks tends to be significant (e.g., Romanoski, 1999; Ankest et al., 2000), there has been a prejudice against the need for, or importance of, the human in the DM process because of over emphasis on its &ldquo;automatic&rdquo; or &ldquo;semiautomatic&rdquo; aspects. To the best of our knowledge, the current study is the first one to systematically investigate human roles in the DM process and model the DM system (in fact, a human computer system) as a dynamic and interactive whole with four individually functioning components. In addition, as the first attempt from outside the DM community to study human issues in the DM process, the current study has introduced useful methodology that is specifically designed to study the human computer system. The current study employed a progressive modeling approach with data from published studies, interviews, and field observations with Subject Matter Experts (SMEs). Two sets of ACTA questionnaires invited eight SMEs to introspect the mental demands they faced and cognitive skills they applied in their DM activities. The first part of field observation studied six SMEs applying DM techniques in their research, identified and analyzed their interfaces with the computer during the DM process, decision making points, and complexity and resources in the decision making. Their struggles and concerns about the current DM system and how they have been accommodating to the cognitive demands were elicited and documented. The second part of field observation focused on collaborative meetings between domain experts and data mining experts. These meetings became zoomed views of those sub tasks found in the stage of selecting or developing algorithms to build a DM model. The collaborative meetings revealed the socio-technical aspects of the DM system, and directed further investigation on how human data analysts with different expertise communicate and integrate their knowledge and skills in developing DM models. (Abstract shortened by UMI.)
Combinatorial algorithms involving pattern containing and avoiding permutations
Authors: Rebecca Nicole Smith
Venue:  (2005)

For the first part of this dissertation, we look at two standard algorithms used to sort permutations by t stacks in series. The first is the right-greedy algorithm created by West. The second is the left-greedy algorithm introduced by Atkinson, Murphy, and Ru&scaron;kuc. They showed that the left-greedy algorithm is optimal for t = 2. By considering where entries of the permutation are at key points in the process, we show that the use of the left-greedy algorithm on t stacks in series will result in sorting any permutation that could be sorted using the right-greedy algorithm on t stacks in series. For t &ge; 2, we show how to construct permutations that can be sorted by just two stacks in series using the left-greedy algorithm, but cannot be sorted by t stacks in series using the right-greedy algorithm. We also prove that when applied to t stacks in series where t > 2, the use of the left-greedy algorithm is not optimal nor is the class of permutations sorted by the left-greedy algorithm closed. Then we allow the addition of a type of movement on the stacks where entries from the last stack can return to the first stack instead of going to the output. We show that this allowance does nothing to improve the sorting ability of two stacks in series. However, when this move is introduced to three or more stacks in series, we are then able to sort any permutation. We also look at the parity of the number of permutations of length n sortable by one or two stacks. In the case of one stack, this result is well known. The parity of the number of 2-stack sortable permutations of length n has been recently determined combinatorially by B&oacute;na. We present a semi-combinatorial proof that the number of permutations of length n which are sortable by two stacks in series is odd exactly half the time. Finally, we consider the problem of permutation reconstruction. This problem is an analogue of graph reconstruction, a long-considered question in graph theory. In the case of permutations, the problem can be stated as follows: In all possible ways, delete k entries of the permutation p = p1p2 p3&hellip;pn and renumber accordingly, creating &parl0;nk&parr0; substrings. How large must n be in order for us to be able to reconstruct p from this multiset of substrings? That is, how large must n be to guarantee that this multiset is unique to p? It is not difficult to show that if k = 1, then n must be at least five to guarantee the reconstruction of p. We will then present a proof that when k = 2, we only need n to be at least six to guarantee the reconstruction of p. We also present some partial results for when k > 2.
Suppressing Data Sets to Prevent Discovery of Association Rules
Authors: Ayca Azgın Hintoglu, Ali Inan, Yucel Saygın, Mehmet Keskinoz
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Enterprises have been collecting data for many reasons including better customer relationship management, and high-level decision making. Public safety was another motivation for large-scale data collection efforts initiated by government agencies. However, such widespread data collection efforts coupled with powerful data analysis tools raised concerns about privacy. This is due to the fact that collected data may contain confidential information. One method to ensure privacy is to selectively hide confidential information from the data sets to be disclosed. In this paper, we focus on hiding confidential correlations. We introduce a heuristic to reduce the information loss and propose a blocking method that prevents discovery of confidential correlations while preserving the usefulness of the data set.
Automatic Maintenance of Association Invariants
Authors: James Welch, David Faitelson, Jim Davies
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Many approaches to software specification and design make use of invariants: statements whose truth is preserved under various operations upon a system or component. Approaches that involve the construction of object-oriented or entity-relationship models require the expression of a particular kind of global invariant, concerning associations between objects or entities. This paper shows how association invariants can be expressed in a new, object-based formal language. It then explains how these expressions can be used to determine pre - and post-conditions for local operations, sufficient to ensure that the invariants are maintained. These conditions-and the program text to implement them can be generated automatically. This makes it easier to produce correct implementations of an objectoriented design.
Implicit Multicast Routing Protocol
Authors: Thiruvengadam Venketesan, Wu-Hon F. Leung
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

This paper describes the IMcast (Implicit Multicast) routing protocol, developed to address several problems that are responsible for the slow deployment of IP Multicast. We focus on transparent integration with legacy routers and in improving the efficiency of the routing tree. IMcast packets carry unicast addresses in the destination field of IPv4 header and multicast addresses on a separate header. As a result, one can integrate IMcast routers into the Internet without changes to existing routers. The address space for multicast connections is separate and independent of unicast addresses. IMcast builds and maintains shortest path trees from the sender to the receivers. The performance of its control plane scales well. IMcast can also be used as an automatic tunneling protocol to connect existing islands of IP multicast in the Internet. The routing tree construction algorithm has been validated with an implementation.
Correcting Flicker in Color Motion Pictures
Authors: K. K. Wong, A. Das, M. N. Chong
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Despite active research work in the field of flicker correction, all the published work to date only deals with black and white motion pictures. In this paper, we will take flicker correction into the color space and propose a method to solve the flicker correction problem in color motion pictures. The method is based on a simplified flicker parameter model developed by us in [5] which was originally used for flicker correction in black and white motion pictures. Test results show that the proposed method is very effective in correcting flicker-damaged color films.
Untraceable RFID tags via insubvertible encryption
Authors: Giuseppe Ateniese, Jan Camenisch, Breno de Medeiros
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

We introduce a new cryptographic primitive, called insubvertible encryption, that produces ciphertexts which can be randomized without the need of any key material. Unlike plain universal re-encryption schemes, insubvertible encryption prevents against adversarial exploitation of hidden channels, by including certificates proving that the ciphertext can only be decrypted by authorized parties.The scheme can be applied to RFID tags, providing strong protection against tracing. This enables post-sale applications of manufacturer-issued RFID tags while preserving the privacy of consumers. The functionality required of the RFID tags is minimal, namely that they be re-writable (many-writable). No cryptographic capabilities are required of the tags themselves, as the readers perform all necessary computations.
Requirements Engineering and the Creative Process in the Video Game Industry
Authors: David Callele, Eric Neufeld, Kevin Schneider
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

The software engineering process in video game development is not clearly understood, hindering the development of reliable practices and processes for this field. An investigation of factors leading to success or failure in video game development suggests that many failures can be traced to problems with the transition from preproduction to production. Three examples, drawn from real video games, illustrate specific problems: 1) how to transform documentation from its preproduction form to a form that can be used as a basis for production, 2) how to identify implied information in preproduction documents, and 3) how to apply domain knowledge without hindering the creative process. We identify 3 levels of implication and show that there is a strong correlation between experience and the ability to identify issues at each level. The accumulated evidence clearly identifies the need to extend traditional requirements engineering techniques to support the creative process in video game development.
Ultra-thin strained SOI substrate analysis by pseudo-MOS measurements
Authors: C. Gallon, C. Fenouillet-Beranger, N. Bresson, S. Cristoloveanu, F. Allibert, S. Bord, C. Aulnette, D. Delille, E. Latu-Romain, J. M. Hartmann, T. Ernst, F. Andrieu, Y. Campidelli, B. Ghyselen, I. Cayrefourcq, F. Fournel, N. Kernevez, T. Skotnicki
Venue: Microelectronic Engineering (2005)

Pseudo-MOS (Ψ-MOSFET) measurements are a simple and rapid technique for an accurate evaluation of SOI wafer intrinsic electrical properties, prior to any CMOS processing. For the first time, we report Ψ-MOSFET measurements performed on Strained SOI (SSOI) wafers with ultra-thin silicon films (9.5 nm to 17.5 nm). To take into account the wafer specificities and the use of such thin conduction layers, adapted Ψ-MOSFET models and parameter extraction methods were necessary. The experiments show an increase of the threshold and flat band voltages and a mobility reduction as the strained film becomes thinner. Further electrical analyses, coupled with several morphological studies, do not reveal any relaxation of the strain in the thinnest films. The mobility is clearly enhanced in SSOI as compared with standard SOI substrates.
Supporting Multi-Dimensional Range Queries in Peer-to-Peer Systems
Authors: Yanfeng Shu, Beng Chin Ooi, Kian-Lee Tan, Aoying Zhou
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

Today¿s peer-to-peer (P2P) systems are unable to cope well with range queries on multi-dimensional data. To extend existing P2P systems and thus support multi-dimensional range queries, one needs to consider such issues as space partitioning and mapping, efficient query processing, and load balancing. In this paper, we describe our scheme called ZNet, which addresses all these issues. Moreover, we conduct an extensive performance study which evaluates ZNet against several recent proposals, and our results show that ZNet possesses nearly all desirable properties, while others typically fail in one or another.
Active Rocket Trajectory Arcs: A Review
Authors: D. M. Azimov
Venue: Automation and Remote Control (2005)

This paper reviews the development of analytical, approximate analytical, and numerical methods for solving the variational problem on the determination of optimal rocket trajectories in gravitational fields, and their application to study flight dynamics. Specifics of these methods as applied to solve modern and complex problems are described. A variational problem is formulated and extremal thrust arcs are described. Papers containing results of analytical investigations on thrust arcs are reviewed in depth. Partially investigated problems are described. Problems of great interest in the development of methods for solving the variational problem and problems in the theory of optimal trajectories are mentioned.
Une infrastructure &agrave; composants pour des applications ubiquitaires
Authors: Areski Flissi, Christophe Gransart, Philippe Merle
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

Multiplication of mobile devices and generalized use of wireless networks imply changes on software applications design and execution. This new challenge is now called ubiquitous computing. In this paper, we present a software infrastructure dedicated to ubiquitous contextual services. They are designed as assemblies of distributed software components and are dynamically discovered according to end-users' physical location and device capabilities and automatically deployed on it. We have implemented this software infrastructure and an example of service on top of the OMG CORBA Components Model and the OpenCCM open source platform.
FORMI: an RMI extension for adaptive applications
Authors: Rüdiger Kapitza, Michael Kirstein, Holger Schmidt, Franz J. Hauck
Venue: Proceedings of the 4th workshop on Reflective and adaptive middleware systems (2005)

RMI is a well-known middleware that smoothly integrates into Java. RMI uses classical RPC-based client-server interaction, precisely remote method calls. Although RMI has several extension points (i.e., for replacing transport protocols and call semantics), this is not enough for many applications as it can not cope with non-RPC-based communication, fault tolerance, scalability, and quality-of-service in general. We present FORMI, an RMI extension for supporting the very flexible fragmented-object model. This model allows to build distributed objects with arbitrary internal communication protocols and interaction patterns (e.g., internal peer-to-peer communication) and with a truly distributed internal structure (e.g., replicated servers, smart proxies, hierarchical servers). Both, internal communication and structure, remains hidden behind the RMI-object interface and is thus transparent to clients. We demonstrate our approach by an Internet radio example.
Designing generic algorithms for operations research: Research Articles
Authors: Bruno Bachelet, Antoine Mahul, Loïc Yon
Venue: Software&mdash;Practice Experience (2006)

Design solutions have been proposed to implement generic data structures, however such techniques dedicated to algorithms are not well known. This article discusses various recurrent problems encountered when designing reusable, extensible algorithms for operations research. It explains how to use object-oriented concepts and the notion of genericity to design algorithms that are independent of the data structures and the algorithms they use, but that can still interact deeply with them. An object-oriented design is sometimes considered to be less efficient than a classical one, and operations research is one of these scientific fields where efficiency really matters. Hence, the main goal of this article is to explain how to design algorithms that are both generic and efficient. It also discusses specific recurring design issues for operations research software and proposes solutions that improve the genericity of the algorithms. Copyright &copy; 2005 John Wiley & Sons, Ltd.