ppxscal/embedding_network huggingface dataset:
The Location Management Scheme Using Mobility Information of Mobile
Authors: Sun-Jin Oh
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Since the latest wireless communication networks allow dynamic relocation of a mobile terminal, the location management mechanism tracking the location of a mobile terminal is required to deliver incoming calls. To provide an efficient location management mechanism, we propose a location management scheme using mobility information of mobile users in wireless mobile networks. In this scheme, the location registration process caches location information of visited cells to reduce the duplicated registrations, the paging process exploitsthe locality of user movement patterns to predict the paging area and, therefore, to reduce the paging cost in location search procedure. The performance of the proposed scheme is to be evaluated by an analytical model, and is compared with that of Wan's basic velocity paging method.
Integrating Customer Value Considerations into Predictive Modeling
Authors: Saharon Rosset, Einat Neumann
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

The success of prediction models for business purposesshould not be measured by their accuracy only. Theirevaluation should also take into account the higherimportance of precise prediction for "valuable"customers. We illustrate this idea through the example ofchurn modeling in telecommunications, where it isobviously much more important to identify potentialchurn among valuable customers. We discuss, boththeoretically and empirically, the optimal use of"customer value" data in the model training, modelevaluation and scoring stages. Our main conclusion isthat a non-trivial approach of using "decayed" value-weightsfor training is usually preferable to the twoobvious approaches of either using non-decayed customervalues as weights or ignoring them.
Data Caches in Multitasking Hard Real-Time Systems
Authors: Xavier Vera, Björn Lisper, Jingling Xue
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

Data caches are essential in modern processors, bridgingthe widening gap between main memory and processorspeeds. However, they yield very complex performancemodels, which makes it hard to bound execution timestightly.This paper contributes a new technique to obtain predictabilityin preemptive multitasking systems in the presenceof data caches. We explore the use of cache partitioning,dynamic cache locking and static cache analysis to provideworst-case performance estimates in a safe and tightway. Cache partitioning divides the cache among tasks toeliminate inter-task cache interferences. We combine staticcache analysis and cache locking mechanisms to ensurethat all intra-task conflicts, and consequently, memory accesstimes, are exactly predictable. To minimize the performancedegradation due to cache partitioning and locking,two strategies are employed. First, the cache is loaded withdata likely to be accessed so that their cache utilization ismaximized. Second, compiler optimizations such as tilingand padding are applied in order to reduce cache replacementmisses.Experimental results show that this scheme is fully predictable,without compromising the performance of thetransformed programs. Our method outperforms staticcache locking for all analyzed task sets under variouscache architectures, with a CPU utilization reductionranging between 3.8 and 20.0 times for a high performancesystem.
Configurable Platforms With Dynamic Platform Management: An Efficient Alternative to Application-Specific System-on-Chips
Authors: Krishna Sekar, Kanishka Lahiri, Sujit Dey
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Emerging trends in system design indicate that inthe future, a large role will be played by System-on-Chip (SoC)platforms consisting of general-purpose, configurable components.Commercially available SoC platforms provide some degreesof configurability, most of which are limited to one-time(static) customization of platform hardware. However, with increasingapplication diversity, time-varying requirements, andthe convergence of multiple applications on the same platform,there is a growing need for SoC platforms that can be dynamicallyconfigured in order to adapt to changing requirements.In this paper, we propose general-purpose, dynamically configurable,SoC platforms featuring multiple configurability options,and illustrate their advantages over existing design styles.We survey technologies that aim at providing dynamically configurableplatform components (e.g., processors, caches, memorysub-systems, bus architectures), and associated techniquesfor exploiting such configurability. In particular, we illustratehow run-time platform customization of configurable, general-purposeplatforms using Dynamic Platform Management techniques(using a dual-access UMTS/WLAN security processingsystem as a case study) can achieve significant improvements inoverall system performance and energy-efficiency.
Perceptual Digital Watermarking for Image Authentication in Electronic Commerce
Authors: Ming-Shing Hsieh, Din-Chang Tseng
Venue: Electronic Commerce Research (2004)

Digital watermarking has been presented to protect the copyright of electronic multimedia data. The previous proposed watermarking algorithms mostly embed sequences of random numbers or binary images as the watermarks. In this paper, an image accreditation technique by embedding digital gray-level image watermarks in images is proposed. In the proposed method, the host image and the watermark are decomposed into wavelet coefficients. The contextual energies of the host-image wavelet coefficients are computed to select embedding coefficients. The watermark wavelet coefficients are sorted and then embedded in the selected host coefficients. The experiments show that the proposed method provides extra robustness against JPEG-compression, image-processing, and even composite attacks compared to the traditional embedding methods. Moreover, the proposed method has no need of the original image to extract the embedded watermarks. The proposed method facilitates electronic commerce application developers to select adequate digital watermarking techniques for their development systems.
Scalable Multilateral Communication Technique for Large-Scale Information Systems
Authors: Khaled Ragab, Naohiro Kaji, Koichi Moriyama, Kinji Mori
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Autonomous Community Information System (ACIS) is aproposition made to contend with the extreme dynamism inthe large-scale information system. ACIS is a decentralizedbilateral-hierarchy architecture that forms a community ofindividual end-users (community members) having thesame interests and demands in somewhere, at specified time.It allows the community members to mutually cooperateand share information without loading up any single nodeexcessively. In this paper, an autonomous decentralizedcommunity communication technique is proposed to assurea flexible, scalable and a multilateral communicationamong the community members. The main ideas behindthis communication technique are: content-codecommunication (community service-based) for flexibilityand multilateral benefits communication for scalable andproductive cooperation among members. All memberscommunicate productively for the satisfaction of all thecommunity members. The scalability of the system'sresponse time regardless of the number of the communitymembers has been shown by simulation. Thus, theautonomous decentralized community communicationtechnique reveals great results of the response time withcontinuous increasing in the total number of members.
IBHIS: Integration Broker for Heterogeneous Information Sources
Authors: Ioannis Kotsiopoulos, John Keane, Mark Turner, Paul Layzell, Fujun Zhu
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Effective use of heterogeneous, distributedinformation in a coherent, integrated fashion has longbeen a 'holy grail'. The UK Health and Social caredomain is an example where a global view is needed tofacilitate decision making, whilst having ethical and legalconcerns. The IBHIS project aims to provide anintegrated broker that enables coherent use of a set ofdistributed, heterogeneous data sources, whilst ensuringtrustworthiness and audit. This paper presents a service-orientedfederated architecture for the IBHIS broker.
A comparison of PASCAL and FORTRAN as introductory programming languages
Authors: Gary J. Nutt
Venue: ACM SIGPLAN Notices (1978)

Many colleges and universities offer introductory programming classes based on the FORTRAN language. Several of these schools are contemplating a change to a more modern programming language in this first course. The Department of Computer Science at the University of Colorado has recently made the transition from FORTRAN to PASCAL, and this paper offers an informal discussion of the experiences of one instructor during that change. It is hoped that others who may be considering a similar change will benefit from our experiences.
Mobile commerce at crossroads
Authors: Sirkka L. Jarvenpaa, Karl Reiner Lang, Yoko Takeda, Virpi Kristiina Tuunainen
Venue: Communications of the ACM (2003)

Lessons learned from an international study of users of mobile handheld devices and services.
Higher-order time integration schemes for the unsteady Navier--Stokes equations on unstructured meshes
Authors: Giridhar Jothiprasad, Dimitri J. Mavriplis, David A. Caughey
Venue: Journal of Computational Physics (2003)

The efficiency gains obtained using higher-order implicit Runge-Kutta (RK) schemes as compared with the second-order accurate backward difference schemes for the unsteady Navier-Stokes equations are investigated. Three different algorithms for solving the nonlinear system of equations arising at each time step are presented. The first algorithm (nonlinear multigrid, NMG) is a pseudo-time-stepping scheme which employs a nonlinear full approximation storage (FAS) agglomeration multigrid method to accelerate convergence. The other two algorithms are based on inexact Newton's methods. The linear system arising at each Newton step is solved using iterative/Krylov techniques and left preconditioning is used to accelerate convergence of the linear solvers. One of the methods (LMG) uses Richardson's iterative scheme for solving the linear system at each Newton step while the other (PGMRES) uses the generalized minimal residual method. Results demonstrating the relative superiority of these Newton's method based schemes are presented. Efficiency gains as high as 10 are obtained by combining the higher-order time integration schemes such as fourth-order Runge-Kutta (RK64) with the more efficient inexact Newton's method based schemes (LMG).
Active Traffic Analysis Attacks and Countermeasures
Authors: Xinwen Fu, Bryan Graham, Riccardo Bettati, Wei Zhao
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

To explore mission-critical information, an adversary using active traffic analysis attacks injects probing traffic into the victim network and analyzes the status of underlying payload traffic. Active traffic analysis attacks are easy to deploy and hence become a serious threat to mission critical applications. This paper suggests statistical pattern recognition as a fundamental technology to evaluate effectiveness of active traffic analysis attacks and corresponding countermeasures. Our evaluation shows that sample entropy of ping packets' round trip time is an effective feature statistic to discover the payload traffic rate. We proposesimple countermeasures that can significantly reduce the effectiveness of ping-based active traffic analysis attacks. Our experiments validate the effectiveness of this scheme, whichcan also be used in other scenarios.
Application of rough sets in the presumptive diagnosis of urinary system diseases
Authors: Jacek Czerniak, Hubert Zarzycki
Venue: Artificial intelligence and security in computing systems (2003)

The main idea of this article is to prepare the model of the expert system, which will perform the presumptive diagnosis of two diseases of urinary system. This is an example of the rough sets theory application to generate the set of decision rules in order to solve a medical problem. The lower and upper approximations of decision concepts and their boundary regions have been formulated here. The quality and accuracy control for approximations of decision concepts family has been provided as well. Also, the absolute reducts of the condition attributes set have been separated. Moreover, the certainty, support and strength factors for all of the rules have been precisely calculated. At the end of the article, the author has also shown the reverse decision algorithm.
Rapid prototyping using high density interconnects
Authors: Richard Hartley, Kenneth Welles,  II, Michael Hartman, Paul Delano, Abhijit Chatterjee
Venue: Proceedings of the conference on European design automation (1990)

This paper introduces the (DIODES) system for the rapid prototyping of DSP electronic systems. DIODES merges silicon compiler and high-density interconnect technology with the goal of prototyping hardware systems as quickly as possible --- within one day. Working from a high-level algorithmic description of a DSP algorithm, DIODES will determine which chips from an inventory of specially designed chips are needed to implement the design. These chips are then placed on a prepared substrate and routed together using computer controlled laser lithography to produce a hardware implementation of the design.
The measurement manifesto
Authors: George Varghese, Cristian Estan
Venue: ACM SIGCOMM Computer Communication Review (2004)

Useful measurement data is badly needed to help monitor and control large networks. Current approaches to solving measurement problems often assume minimal support from routers and protocols (e.g., active measurement) or place the entire burden on the router to support heavy-weight mechanisms (e.g., NetFlow). In this paper we argue that the research agenda in measurement must change to consider measurement solutions which enlist the cooperation of routers, protocols, and tools. We believe that the need is so urgent that the deployment issues associated with such holistic solutions can be finessed by cooperation between a few key ISPs and a few key router vendors. If this agenda is accepted, there is a rich vein of technical problems, hitherto considered only from an active measurement perspective, for which there can be new and effective orchestrated solutions. We illustrate this thesis using two examples. Our major example is that of measuring traffic matrices using class counters and class sampling (as opposed to the implementation cost of per-prefix counters, or the errors inherent in tomography). We also provide a smaller example of measuring route stability by modifying route computation. Beyond specific techniques, we hope the guidelines in this paper can provide a focus for discussion among researchers, router vendors, protocol designers, and network operators---the stakeholders in the measurement enterprise.
Precise Call Graphs for C Programs with Function Pointers
Authors: Ana Milanova, Atanas Rountev, Barbara G. Ryder
Venue: Automated Software Engineering (2004)

The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory accesses through pointer dereferences, as well as indirect procedure calls (e.g., through function pointers in C). Such indirect accesses and calls can be disambiguated with pointer analysis. In this paper we evaluate the precision of one specific pointer analysis (the FA pointer analysis by Zhang et al.) for the purposes of call graph construction for C programs with function pointers. The analysis is incorporated in a production-strength code-browsing tool from Siemens Corporate Research in which the program call graph is used as a primary tool for code understanding.The FA pointer analysis uses an inexpensive, almost-linear, flow- and context-insensitive algorithm. To measure analysis precision, we compare the call graph constructed by this analysis with the most precise call graph obtainable by a large category of existing pointer analyses. Surprisingly, for all our data programs the FA analysis achieves the best possible precision. This result indicates that for the purposes of call graph construction, inexpensive pointer analyses may provide precision comparable to the precision of expensive pointer analyses.
An Accumulation Algorithm for Video Shot Boundary Detection
Authors: T. Lu, P. N. Suganthan
Venue: Multimedia Tools and Applications (2004)

In this paper, an accumulation algorithm for video shot detection is introduced. The algorithm considers the properties of gradual transition. In a gradual transition, there is only a small difference between consecutive frames. The algorithm remembers the differences between consecutive frames and accumulates them. When the accumulation difference exceeds a threshold, an occurrence of shot transition is declared. Our main contributions are to introduce a frame C that remembers the changes from the beginning of a shot and detect the different types of boundaries (cut, fade, dissolve) at one process. We tested our algorithm with clips extracted from MPEG VCDs. The algorithm showed a good performance in detecting the gradual transitions as well as the abrupt cuts and has the ability to identify different types of boundaries.
Topics in structured and unstructured weighted eno schemes
Authors: Chi-Wang Shu
Venue:  (2003)

In this thesis we discuss two topics in structured and unstructured weighted essentially non-oscillatory (WENO) schemes. In the first part, we construct high order WENO schemes for solving the Hamilton-Jacobi equations on unstructured meshes. The main ideas here are nodal based approximations, the usage of monotone Hamiltonians as building blocks on unstructured meshes, nonlinear weights using smooth indicators of second and higher derivatives, and a strategy to choose diversified smaller stencils to make up the bigger stencil in the WENO procedure. Extensive numerical experiments are performed to demonstrate the stability and accuracy of the methods. High-order accuracy in smooth regions, good resolution of derivative singularities, and convergence to viscosity solutions are observed. The second part of this dissertation is a study in the resolution and numerical viscosities of high order finite difference WENO schemes. First, using the Euler equations of compressible flows, we compute solutions containing both discontinuities and complex solution features, through two representative numerical examples: the double Mach reflection problem and the Rayleigh-Taylor (RT) instability problem. We conclude that for solutions with such features, it is more economical in CPU time to use higher order WENO schemes than the lower order schemes to obtain comparable numerical resolution. Then the Navier-Stokes (NS) equations are considered. A quantitative study is carried out to investigate the size of numerical viscosities and the resolution of high order WENO schemes for solving NS equations for compressible flows at high Reynolds numbers. For problems with small scale structures like the RT instability problem, the details of the small structures are determined by the physical viscosity in the NS equations. Thus, in order to resolve these small scale structures, the inherent numerical viscosity of the scheme must be small enough so that the physical viscosity dominates. A mesh refinement study is performed to capture the threshold mesh for full resolution, when WENO schemes of different accuracy orders are used. It is demonstrated again that high order WENO schemes are more CPU time efficient than the lower order schemes to reach the same resolution, for our test problems.
A case for run-time adaptation in packet processing systems
Authors: Ravi Kokku, Taylor L. Riché, Aaron Kunze, Jayaram Mudigonda, Jamie Jason, Harrick M. Vin
Venue: ACM SIGCOMM Computer Communication Review (2004)

Most packet processing applications receive and process multiple types of packets. Today, the processors available within packet processing systems are allocated to packet types at design time. In this paper, we explore the benefits and challenges of adapting allocations of processors to packet types in packet processing systems. We demonstrate that, for all the applications and traces considered, run-time adaptation can reduce energy consumption by 70--80% and processor provisioning level by 40--50%. The adaptation benefits are maximized if processor allocations can be adapted at fine time-scales and if the total available processing power can be allocated to packet types in small granularities. We show that, of these two factors, allocating processing power to packet types is small granularity is more important---if the allocation granularity is large, then even a very fine adaptation time-scale yields meager benefits.
On time versus size for monotone dynamic monopolies in regular topologies
Authors: Paola Flocchini, Rastislav Královič, Peter Ružička, Alessandro Roncato, Nicola Santoro
Venue: Journal of Discrete Algorithms (2003)

We consider a well-known distributed colouring game played on a simple connected graph: initially, each vertex is coloured black or white; at each round, each vertex simultaneously recolours itself by the colour of the simple (strong) majority of its neighbours. A set of vertices M is said to be a dynamo, if starting the game with only the vertices of M coloured black, the computation eventually reaches an all-black configuration.The importance of this game follows from the fact that it models the spread of faults in point-to-point systems with majority-based voting; in particular, dynamos correspond to those sets of initial failures which will lead the entire system to fail. Investigations on dynamos have been extensive but restricted to establishing tight bounds on the size (i.e., how small a dynamic monopoly might be).In this paper we start to study dynamos systematically with respect to both the size and the time (i.e., how many rounds are needed to reach all-black configuration) in various models and topologies.We derive tight tradeoffs between the size and the time for a number of regular graphs, including rings, complete d-ary trees, tori, wrapped butterflies, cube connected cycles and hypercubes. In addition, we determine optimal size bounds of irreversible dynamos for butterflies and shuffle-exchange using simple majority and for DeBruijn using strong majority rules. Finally, we make some observations concerning irreversible versus reversible monotone models and slow complete computations from minimal dynamos.
Progressive Stochastic Search for Solving Constraint Satisfaction Problems
Authors: Bryan Chi-ho Lam, Ho-fung Leung
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Stochastic search methods have attracted much attention of the Constraint Satisfaction Problem (CSP) research community. Traditionally, a stochastic solver escapes from localoptima or leaves plateaus by random restart or heuristic learning. In this paper, we propose the Progressive Stochastic Search (PSS) and its variants for solving binary CSPs, in which a variable always has to choose a new value when it is designated to be repaired. Intuitively, the search can be thought to be mainly driven by a "force" to "rush through" the local minima and plateaus. Timing results show that this approach signi.cantly outperforms LSDL(GENET) [2] in N-Queens, Latin squares, random permutation generation problems and randomly CSPs, while it fails to win LSDL(GENET) in quasigroup completion problems and increasing permutation generation problems. This prompts an interesting new research direction in the design of stochastic search schemes.