ppxscal/embedding_network huggingface dataset:
E-BUS: a toolkit for extracting business services from java software systems
Authors: Shimin Li, Ladan Tahvildari
Venue: Companion of the 30th international conference on Software engineering (2008)

E-BUS (Extracting BUsiness Services) is an integrated environment to extract and model critical business services embedded in Java systems by utilizing graphic representations and transformations of system models. The extracted business services can be realized as self-contained components. Our evaluation has shown that E-BUS is effective and scalable in identifying and extracting business services from large Java legacy systems.
A tutorial on test power
Authors: Vishwani D. Agrawal
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Both average power and peak power specifications of a circuit pose serious problems for the prevalent test methods like scan and built-in self-test. This tutorial discusses the problems and solutions for minimizing power dissipation in these test procedures. Hardware approaches and test vector optimization methods are outlined. Power-constrained testing of core-based systems is discussed. Finally, an open problem of finding an efficient test for verifying the power specification of a system is formulated. Today's electronic systems are complex, fast, and energy efficient. Power is a circuit design criteria, added to the previous list of area, delay and testability. Controlling test power and minimizing test time requires tradeoffs. Design for testability methods like scan and random-pattern self-test use non-functional test inputs that must conform to circuit specifications on average power (energy consumption) and peak power. Test power has thus become an active area of research, innovation and practice. Electronic circuits should dissipate no more power or energy than they are designed for. In testing of circuits cost and quality are the requirements and high fault coverage can lead to long, often nonfunctional, test sequences. Such tests generate substantially higher signal activity and can potentially cause an otherwise good circuit to fail due to excessive power dissipation. Tests are, therefore, run at a slower speed, incurring longer test time and higher test cost. This extra cost of testing does not completely solve the test power problem. The slow speed test can contain high activity vectors that would cause excessive supply current surges. Once again a perfectly good circuit can potentially fail during test due to conditions such as power droop, ground bounce and hot spots.
Supporting schedules of resource co-allocation for distributed computing in scalable systems
Authors: V. V. Toporkov
Venue: Programming and Computing Software (2008)

This paper proposes a model of scheduling and validates methods of resource co-allocation for distributed computations in scalable systems. Solution of the problem of allocating heterogeneous computing resources for performing complex sets of tasks (jobs) is related to the formation of strategies (families of admissible supporting schedules). The choice of a specific schedule depends on the nature of events occurring in the distributed environment and related primarily to the load and accessibility of computing nodes.
Trustworthiness and Confidence of Peers in Peer-to-Peer (P2P) Network
Authors: Yoshio Nakajima, Alireza Goudarzi Nemati, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In a peer-to-peer (P2P) overlay network, a peer process (peer) communicates with other peers and manipulates objects like databases in the peers. It is critical to obtain service information on what peers support what service. In a fully distributed, unstructured P2P network, there is no centralized coordinator. It is critical for a peer to identify which acquaintance is trustworthy since acquaintances may support obsolete service information and may be faulty. There are subjective and objective types of the trustworthiness of each acquaintance. In the subjective approach, a peer obtains the trustworthiness of an acquaintance by itself through communicating with an acquaintance. On the other hand, a peer takes trustworthiness opinions on an acquaintance from other peers. In this paper, a peer only takes opinions of trustworthy peers by excluding faulty peers. A peer has to decide on which trustworthiness type is taken. In this paper, we postulate the more the peer is confident of its trustworthiness opinion, the more the subjective trustworthiness is taken into account.
On the feasibility of high-power radios in sensor networks
Authors: Cigdem Sengul, Mehedi Bakht, Albert F. Harris,  III, Tarek Abdelzaher, Robin Kravets
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

Wireless sensor nodes are constrained by limited energy resources. A significant portion of this limited energy is spent in communication, making energy efficiency of the radio a very important factor in increasing the overall lifetime of a sensor node. An ideal radio, in terms of energy efficiency (ignoring issues of transmission range and delay), should satisfy two requirements. First, it should minimize the energy used per bit when transmitting or receiving. Second, its idle time energy consumption should be minimal. Unfortunately, no such "ideal" radio exists. Current sensor radios (e.g., CC2420) meet the second requirement - the energy consumption in the inactive states is very low in comparison to IEEE 802.11 radios, which are comparatively energy-inefficient due to high switching-on cost and idle state energy consumption. On the other hand, IEEE 802.11 radios perform much better when it comes to energy consumption per bit. So the natural question to ask is whether there exists a way to combine the positive features of these two types of radios leading to increased energy conservation. We argue that this objective can indeed be achieved by adding a high-power IEEE 802.11 radio to the mote platform alongside the already existing sensor radio and managing them by an energy-efficient scheme as proposed in this work.
Linear systems and half-line integral representations
Authors: Irwin W. Sandberg
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

We give an expression for the most general input-output map associated with the members of a certain important large family of causal time-invariant linear systems. This expression is a uniform limit of a convolution. We also give a necessary and sufficient condition under which the limit can be written as a convolution, and we relate this to the concepts of an impulse response and a q-response limit, and to the flawed concept of the Dirac impulse function.
Impact of Fixed Boundary Conditions on the Basins of Attraction in the Flower's Morphogenesis of Arabidopsis Thaliana
Authors: Jacques Demongeot, Michel Morvan, Sylvain Sené
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Classically, theoretical studies focusing on biological systems are based on toric networks, which does not seem to be coherent with the biological reality. We think that the dynamics of biological networks is also regulated by fixed boundaries, illustrated for instance by external magnetic fields, chemical potentials or environmental constraints. The aim of this paper is to go further in the study of the impact of fixed boundary conditions by showing that they significantly affect the relative size of certain basins of attraction. We argue that this is a critical point in real biological networks by giving an example of boundary influence in the genetic regulatory network of the flower’s morphogenesis of the plant Arabidopsis thaliana.
A Unified View of Information-Theoretic Aspects of Cognitive Radio
Authors: Fahim Gohar Awan, Muhammad Fainan Hanif
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Cognitive radio carries bright prospects for very efficient utilization of spectrum in future. Since cognitive radio is still in its early days, many of its theoretical limits are yet to be explored. In particular, determination of its maximum information rates for the most general case is still an open problem. Till today, many cognitive channel models have been presented. Either achievable or maximum bit rates have been evaluated for each of these. This paper attempts to summarize all the existing results, makes a comparison between different channel models and motivates for future research work.
Monotonic and fatigue testing of freestanding submicron thin beams application for MEMS
Authors: Ming-Tzer Lin, Chi-Jia Tong, Kai-Shiang Shiu
Venue: Microsystem Technologies (2008)

A freestanding submicron thin film specimen is designed and fabricated here to carry out a series of monotonic and fatigue testing. This freestanding beam was loaded by performing monotonic loading/unloading or closed-loop load controlled tension&#x2013;tension fatigue experiments on it. Loading was applied using a piezoelectric actuator with 0.1 &#x03bc;m resolution connected to the test specimen. Loads were measured by connected a capacitor load cell with a resolution of less than 0.1&#x00a0;mN. The modulus, yield stress and maximum stress of tested submicron thin films at room temperature were found from monotonic loading/unloading tests. The results of 300&#x00a0;nm copper thin films fatigue experiments demonstrated a trend of decreasing cycles to failure with increasing loading amplitude and increasing mean stress.
BTF modelling using BRDF texels
Authors: Jirí Filip, Michal Haindl
Venue: International Journal of Computer Mathematics (2007)

The highest fidelity representations of realistic real-world materials currently comprise Bidirectional Texture Functions (BTF). The BTF is a six-dimensional function depending on view and illumination directions as well as on planar texture coordinates. The huge size of such measurements, typically in the form of thousands of images covering all possible combinations of illumination and viewing angles, has prohibited their practical exploitation, and obviously some compression and modelling method of these enormous BTF data spaces is inevitable. The two proposed approaches combine BTF spatial clustering with cluster index modelling by means of efficient Markov random field models. The methods allow the generation of a seamless cluster index of arbitrary size to cover large virtual 3D object surfaces. Both methods represent original BTF data using a set of local spatially dependent Bidirectional Reflectance Distribution Function (BRDF) values which are combined according to the synthesized cluster index and illumination/viewing directions by means of two types of Markov random field models. BTF data compression using both methods is about 1:200 and their synthesis is very fast.
Bi-directional Mapping System as a New IPv4/IPv6 Translation Mechanism
Authors: Ra'ed AlJa'afreh, John Mellor, Mumtaz Kamala, Basil Kasasbeh
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

A new Internet protocol (IPv6) is being deployed with new features and improvements for the devices that are connected to the network. Unfortunately, the current Internet Protocol (IPv4) and the new Internet Protocol (IPv6) are incompatible with each other. During the time of migration from IPv4 to IPv6 networks, when both versions are available and the users of Internet want to connect without any restrictions, a transition mechanism is required. A number of transition mechanisms have been proposed by the Internet Engineering Task Force (IETF) in order to ensure smooth and independent changeover from IPv4 to IPv6 networks. In this paper, we propose a new flexible transition scheme which is known as the Bi-Directional Mapping System (BDMS) that deals with the IPv4/IPv6 address mapping transition as well as converting the received packets to their destination environment. Our new transition scheme (BDMS) is simple, efficient, and easy to implement. BDMS reduces the packet size compared with tunneling mechanisms and reduces the costs of the IPv6 network compared with the dual stack mechanisms.
A multi-fidelity software framework for interactive modeling of advective and diffusive contaminant transport in groundwater
Authors: Vijay Kalivarapu, Eliot Winer
Venue: Environmental Modelling Software (2008)

Groundwater currently accounts for over 20% of the daily water usage in the United States. As the contamination of groundwater reserves also continues to increase from a variety of pollutants, remediation becomes necessary. Whether the remediation method involves containing or cleaning, a fundamental understanding of the groundwater flow patterns is necessary. This can now be gained through predictive models due to advances in groundwater simulation research. One such method, the Superblock Analytical Element Method (AEM) is capable of capturing both large-scale trends and small-scale variations in complex, heterogeneous flow fields. These trends and variations are not captured by current numerical solutions, typified by finite difference and finite element formulations. The Superblock AEM, as with many groundwater solvers, has a substantial number of input parameters and produces large amounts of 3D output. Thus, an intuitive, 3D visual framework would greatly enhance the usability of the method. With the Superblock AEM as a core solver, Groundwater TRANsport 3D (GTRAN3D) has been developed to provide a platform for modeling and viewing advective and diffusive contaminant spreading over non-intersecting spheroidal in-homogeneities in groundwater. The developed system allows a user to create an input scenario through an interactive three-dimensional graphical user interface (GUI), send that input to the solver, and then view the results on systems ranging from desktop computers to immersive Virtual Reality (VR) environments. In addition, the software can be used on any operating system or even accessed via a web interface. The development of the software framework is discussed along with the presentation of several test cases.
Numerical modeling of double-layered piezoelectric transducer systems using a high-order discontinuous Galerkin method
Authors: Eivind Brodal, Jan S. Hesthaven, Frank Melandsø
Venue: Computers and Structures (2008)

A high-order discontinuous Galerkin finite element method, on triangular elements, is used to model piezoelectric systems. Non-destructive testing problems are studied. In particular, flex circuit transducer designs which can be used to obtain information about the surroundings. The focus is to look at simple transducer designs, where the system reduces to a two-dimensional plane strain problem or a one-dimensional longitudinal strain problem. Numerical modulations are compared to analytical/exact solutions obtained from a longitudinal strain model, in both time and frequency domains.
An optimal multiprocessor combinatorial auction solver
Authors: Shouxi Yang, Alberto Maria Segre, Bruno Codenotti
Venue: Computers and Operations Research (2009)

A combinatorial auction (CA) is an auction that permits bidders to bid on bundles of goods rather than just a single item. Unfortunately, winner determination for CAs is known to be NP-hard. In this paper, we propose a distributed algorithm to compute optimal solutions to this problem. The algorithm uses nagging, a technique for parallelizing search in heterogeneous distributed computing environments. Here, we show how nagging can be used to parallelize a branch-and-bound algorithm for this problem, and provide empirical results supporting both the performance advantage of nagging over more traditional partitioning methods as well as the superior scalability of nagging to larger numbers of processors.
Toward Quality-Driven Web Service Discovery
Authors: Eyhab Al-Masri, Qusay H. Mahmoud
Venue: IT Professional (2008)

Despite the proliferation of service-oriented architecture (SOA) techniques for reusing software assets, Web service discovery remains an obstacle to fully realizing service-oriented computing. Given that Web service discovery is a key component in SOC, the lack of Web service quality standards and quality-based discovery mechanisms can stand in the way of dynamic business-to-business interactions. This article discusses the challenges associated with Web service discovery and proposes a solution based on the quality of Web service (QWS) concept.
Using supplier locality in power-aware interconnects and caches in chip multiprocessors
Authors: Ehsan Atoofian, Amirali Baniasadi
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

Conventional snoopy-based chip multiprocessors take an aggressive approach broadcasting snoop requests to all nodes. In addition each node checks all received requests. This approach reduces the latency of cache to cache transfer misses at the expense of increasing power. In this paper we show that a large portion of interconnect/cache transactions are redundant as many snoop requests miss in the remote nodes. We exploit this inefficiency and introduce power optimization techniques for chip multiprocessors. Our optimizations rely on the observation that in a snoopy-based shared memory system the data supplier can be predicted with high accuracy. Our optimizations reduce power by eliminating unnecessary activity at both the requester and the supplier end of snoop requests. We reduce power as we (a) avoid broadcasting snoop requests to all processors and (b) avoid tag lookup for all nodes and for all requests arriving. In particular, we use supplier locality and introduce the following two optimizations. First, and at the requester end, we introduce speculative selective request (SSR) to reduce power dissipation in the binary tree interconnect. In SSR, we send the request only to the node more likely to have the missing data. We reduce power as we limit access only to the interconnect components between the requestor and the supplier node. Second, and at the supplier end, we propose speculative tag lookup (STL) to reduce power dissipation in data caches. We filter those accesses more likely to miss in the L"1 cache. Using shared memory applications, we show that by limiting snoop requests to the speculated nodes we reduce interconnect power by 25% in a four-way multiprocessor. Moreover, we show that speculative tag lookup reduces power in tag arrays by 14.1% in a four-way multiprocessor. Both optimizations come with negligible performance loss and hardware overhead.
Muliple routing configurations demonstrator: IP fast reroute in practice
Authors: Tarik Cicic, Ole Kristoffer Apeland
Venue: Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion (2007)

We demonstrate IP fast reroute using a recently proposed method called Multiple Routing Configurations. The demonstrator comprises a small network of Linux routers, where the effect of network failures can be observed on real-time applications with and without IP fast reroute in effect.
Optimal bandwidth allocation for multimedia mobile networks using particle swarm optimization
Authors: N. K. Karthikeyan, P. Narayanasamy
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)

Though significant improvement in communication infrastructure has been attained in the mobile network technology, the issues concerning the optimized bandwidth allocation to different applications in a reasonable time remain challenging and need to be solved. Also varying mobility and various service class requirements of present multimedia applications makes it more critical. It is mostly realized in the present Third Generation (3G) and Beyond 3G (B3G) mobile network system. Hence an effective and efficient bandwidth optimization schemes for a cellular mobile network system are needed. In this paper we propose an algorithm based upon the Particle Swarm Optimization (PSO) approach to solve the bandwidth allocation problem. The PSO algorithm is an adaptive algorithm based on a social-psychological metaphor; a population of individuals adapts by returning stochastically toward previously successful regions. Although PSO is a population based evolutionary technique like Genetic Algorithm it differs in that each particle or solution contains a position, velocity and acceleration. We explore and analyze the behavior of particle by examining the computational results of our PSO algorithm under different parameter settings. The performance of the PSO algorithm is compared with metaheuristic technique namely Simulated annealing (SA). Experimental results shown that the proposed PSO algorithm is an efficient and competitive approach in composing fairly good results with respect to solution quality and execution time for the bandwidth optimization problem as compared with SA.
Measuring rice paddy persistence spanning a century with Japan's oldest topographic maps: georeferencing the Rapid Survey Maps for GIS analysis
Authors: D. S. Sprague, N. Iwasaki, S. Takahashi
Venue: International Journal of Geographical Information Science (2007)

The Rapid Survey Maps, or Jinsoku Sokuzu, are the first series of topographic maps covering a large region drawn by modern surveying methods in Japan. These maps have no projection or map grid. To incorporate them into a historical GIS, analysts need to identify valid ground control points to georeference these maps, and identify features that are more likely to be distorted than other features. We studied the internal distortion in Rapid Survey Maps while carrying out an overlay analysis for rice paddies between them and a modern land use map. An irregular overall pattern of distortion implied that most were due to local surveying errors. In particular, long, thin rice paddy branches were distorted, leading to mismatches between rice paddies in the older maps with those in the newer map. This mismatch tended to exaggerate the area of rice paddies lost to non-paddy land uses in the overlay analysis with a modern land use map.
SpidersRUs: Creating specialized search engines in multiple languages
Authors: Michael Chau, Jialun Qin, Yilu Zhou, Chunju Tseng, Hsinchun Chen
Venue: Decision Support Systems (2008)

While small-scale search engines in specific domains and languages are increasingly used by Web users, most existing search engine development tools do not support the development of search engines in languages other than English, cannot be integrated with other applications, or rely on proprietary software. A tool that supports search engine creation in multiple languages is thus highly desired. To study the research issues involved, we review related literature and suggest the criteria for an ideal search tool. We present the design of a toolkit, called SpidersRUs, developed for multilingual search engine creation. The design and implementation of the tool, consisting of a Spider module, an Indexer module, an Index Structure, a Search module, and a Graphical User Interface module, are discussed in detail. A sample user session and a case study on using the tool to develop a medical search engine in Chinese are also presented. The technical issues involved and the lessons learned in the project are then discussed. This study demonstrates that the proposed architecture is feasible in developing search engines easily in different languages such as Chinese, Spanish, Japanese, and Arabic.