ppxscal/embedding_network huggingface dataset:
Managing Access to Distributed Resources
Authors: Dieter Spahni
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

In the year 2003 the administration portal for Switzerland, www.ch.ch, went live. This portal is based on a powerful meta-database of available resources and services of the public administration and allocates a unique name, a URN (Uniform Resource Name), to every resource. The URN:Technology, adapted to the requirements of www.ch.ch, became an open standard and a building block of the Swiss eGovernment platform. This article sketches the URN:Technology. Here one establishes why URN:Technology represents nowadays a key factor in the success of building and operating large portals with decentralized responsibility for the resources and interlinking in vast and established federal structures. Search engines which are based on this URN:Technology enable searches on subject-specific areas of information as well as new forms of navigation. The present meta-database of URN:Technology is already similar to UDDI in terms of structure. A vision for the Virtual Desk Switzerland is presented extending the resource registry into a transaction hub interconnecting processes that cross administrative boundaries.
Minimal Work for Separation Processes of Binary Mixtures
Authors: S. A. Amelkin, A. M. Tsirlin, J. M. Burzler, S. Schubert, K. H. Hoffmann
Venue: Open Systems Information Dynamics (2003)

The work expenditures for both perfect and imperfect separation processes are well known for the reversible case; yet such a description is often far from reality. Real processes operate at finite times and non-zero rates leading to an additional, irreversible energy expenditure. This paper employs an idealized van t'Hoff chamber as a theoretical model to derive lower bounds for the irreversible work in real separation processes such as membrane separation. Methods of optimal control for open systems and nonlinear programming of averaged problems are used to calculate the optimal mass transfer kinetics for the finite-time separation of binary mixtures of ideal gases.
A distributed intelligent discrete-event environment for autonomous agents simulation
Authors: M. Jamshidi, S. Sheikh-Bahaei, J. Kitzinger, P. Sridhar, S. Xia, Y. Wang, J. Liu, E. Tunstel,  Jr., M. Akbarzadeh, A. El-Osery, M. Fathi, X. Hu, B. P. Zeigler
Venue: Applied system simulation: methodologies and applications (2003)

This chapter presents a fusion between discrete-event systems specification (DEVS) and intelligent tools from soft computing. DEVS provides a robust and generic environment for modeling and simulation applications employing single workstation, distributed, and real-time platforms. Soft computing is a consortium of tools for natural intelligence stemming from approximate reasoning (fuzzy logic), learning (neural network or stochastic learning automaton), optimization (genetic algorithms and genetic programming), etc. The outcome of this fusion is what is called "Intelligent DEVS", called IDEVS here. IDEVS is an element of a virtual laboratory, called V-Lab®., which is based on distributed multi-physics, multi-dynamic modeling techniques for multiple platforms. The chapter will introduce IDEVS and V-Lab®. and a theme example for a multi-agent simulation of a number of robotic agents with a slew of dynamic models and multiple computer work stations.
Transformation Volatility and the Gateway Model for Web Page Migration to Small Screen Devices
Authors: Carolyn Watters, Bonnie MacKay
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

More people are using their smaller devices to access the Web. In this paper, we concentrate on the effect of migrating Web pages from large screened devices to small screened devices for users who use a Web site first on the larger screen and then use thesame site on the small screen. We examine transformation volatility, including cognitive andnavigational factors, related to the user experience while switching between devices for Web page use. A user's cognitive volatility can be minimized by using a transformation method that both enables the user to reuse their existing mental model of a Web page first viewed on the large screen on the small screen and by decreasing the cognitive load required to comprehend the interface components. The navigational volatility relates to a user's expectation of how to navigate a new instance of a page on a different screen size and isinfluenced by changes to layout, content, location of options, and legibility.We propose a model for automatic transformation of Web pages called the Gateway that creates reduced replica of the source page. The Gateway transformation model minimizes the effect of transformation volatility for users switching between different screen sizes. Based on a subjective ranking of twenty-five randomly generated Gateways from original Web pages, twenty-two of the Gateway pages were ranked excellent or good. We examine the transformation volatility with three transformation models: direct, linear, and the Gateway.
Joint Policy Management and Auditing in Virtual Organizations
Authors: Timothy J. Smith, Lavanya Ramakrishnan
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

A major problem facing organizations using grid-computingmodels is the reluctance to participate in multi-organizationalcollaborative environments due to securityconcerns, such as unauthorized access, and fair resourceusage. The Joint control of Virtual Organizations (JoVO)framework enables organizations to form a unified VO, withjointly agreed, knowable and enforceable security policies.The JoVO framework is based on the fault and intrusiontolerant joint control of identity, attributes, and access controlpolicy through the use of threshold-based certificationauthorities. We propose a set of agents, the Credential ManagementAgent and Identity and Authorization Agent to aidgrid services when operating in a multi-domain environment.One of the key areas of concern in grid computingis the assurance of all parties involved that security policiesare appropriate and will be enforced. We propose anautomated distributed audit agent framework consisting ofwhite-box and black-box service testing for joint validationof access control policy.
A nonconforming combination of the finite element and volume methods with an anisotropic mesh refinement for a singularly perturbed convection-diffusion equation
Authors: Song Wang, Zi-Cai Li
Venue: Mathematics of Computation (2003)

In this paper we formulate and analyze a discretization method for a 2D linear singularly perturbed convection-diffusion problem with a singular perturbation parameter ε. The method is based on a nonconforming combination of the conventional Galerkin piecewise linear triangular finite element method and an exponentially fitted finite volume method, and on a mixture of triangular and rectangular elements. It is shown that the method is stable with respect to a semi-discrete energy norm and the approximation error in the semi-discrete energy norm is bounded by Ch√|ln ε/ln h| with C independent of the mesh parameter h, the diffusion coefficient ε and the exact solution of the problem.
Design of narrowband highpass FIR filters using sharpening RRS filter and IFIR structure
Authors: Gordana Jovanovic-Dolecek
Venue: Practicing software engineering in the 21st century (2003)

This chapter presents the design of narrowband highpass linear-phase finite impulse response (FIR) filters using the sharpening recursive running sum (RRS) filter and the interpolated finite impulse response (IFIR) structure. The novelty of this technique is based on the use of sharpening RRS filter as an image suppressor in the IFIR structure. In that way, the total number of multiplications per output sample is considerably reduced.
TAS: an accurate timing analyser for CMOS VLSI
Authors: A. Hajjar, A. Greiner, R. Marbot, P. Kiani
Venue: Proceedings of the conference on European design automation (1991)

A CMOS timing analyser using accurate delay models is presented. Switch-level analytic delays are derived from (I/V) characteristics of short-channel Mosfets. A significant improvement in accuracy is obtained from the analysis of pertinent capacitances, modeling conflicts and slope effects in CMOS gates. The program handles large-scale circuits and gives the worst-case delays between circuit terminals in realistic CPU times. The algorithm of path-analysis is described. It is concluded that the run time is linear with the number of transistors, the accuracy within 5% over a wide range of design types.
Distributed and local sensing techniques for face-to-face collaboration
Authors: Ken Hinckleyss
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

This paper describes techniques that allow users to collaborate on tablet computers that employ distributed sensing techniques to establish a privileged connection between devices. Each tablet is augmented with a two-axis linear accelerometer (tilt sensor), touch sensor, proximity sensor, and light sensor. The system recognizes when users bump two tablets together by looking for spikes in each tablet's accelerometer data that are synchronized in time; bumping establishes a privileged connection between the devices. Users can face one another and bump the tops of two tablets together to establish a collaborative face-to-face workspace. The system then uses the sensors to enhance transitions between personal work and shared work. For example, a user can hold his or her hand near the top of the workspace to "shield" the display from the other user. This gesture is sensed using the proximity sensor together with the light sensor, allowing for quick "asides" into private information or to sketch an idea in a personal workspace. Picking up, putting down, or walking away with a tablet are also sensed, as is angling the tablet towards the other user. Much research in single display groupware considers shared displays and shared artifacts, but our system explores a unique form of dual display groupware for face-to-face communication and collaboration using personal display devices.
Automatic browsing of large pictures on mobile devices
Authors: Hao Liu, Xing Xie, Wei-Ying Ma, Hong-Jiang Zhang
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Pictures have become increasingly common and popular in mobile communications. However, due to the limitation of mobile devices, there is a need to develop new technologies to facilitate the browsing of large pictures on the small screen. In this paper, we propose a novel approach which is able to automate the scrolling and navigation of a large picture with a minimal amount of user interaction on mobile devices. An image attention model is employed to illustrate the information structure within an image. An optimal image browsing path is then calculated based on the image attention model to simulate the human browsing behaviors. Experimental evaluations of the proposed mechanism indicate that our approach is an effective way for viewing large images on small displays.
CAIM Discretization Algorithm
Authors: Lukasz A. Kurgan, Krzysztof J. Cios
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--The task of extracting knowledge from databases is quite often performed by machine learning algorithms. The majority of these algorithms can be applied only to data described by discrete numerical or nominal attributes (features). In the case of continuous attributes, there is a need for a discretization algorithm that transforms continuous attributes into discrete ones. This paper describes such an algorithm, called CAIM (class-attribute interdependence maximization), which is designed to work with supervised data. The goal of the CAIM algorithm is to maximize the class-attribute interdependence and to generate a (possibly) minimal number of discrete intervals. The algorithm does not require the user to predefine the number of intervals, as opposed to some other discretization algorithms. The tests performed using CAIM and six other state-of-the-art discretization algorithms show that discrete attributes generated by the CAIM algorithm almost always have the lowest number of intervals and the highest class-attribute interdependency. Two machine learning algorithms, the CLIP4 rule algorithm and the decision tree algorithm, are used to generate classification rules from data discretized by CAIM. For both the CLIP4 and decision tree algorithms, the accuracy of the generated rules is higher and the number of the rules is lower for data discretized using the CAIM algorithm when compared to data discretized using six other discretization algorithms. The highest classification accuracy was achieved for data sets discretized with the CAIM algorithm, as compared with the other six algorithms.
Supporting Mobile Professionals in Global Banking: The Role of Global ICT-Support Call-Centres
Authors: Adel Al-Taitoon, Carsten Srensen
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

The aim of this paper is to address the role of ICTsupport call-centres in supporting mobileprofessionals. In global organisations, mobile professionals require constant and continuous access to information services. In modern global banking firms, ICTs are intensively utilised for electronic transactional processing and in supporting banking professionals in accomplishing their global tasks across geographical locations and time zones. The use of ICTs by global mobile bankers is crucial to access real-time information, anytime and anywhere. In their remote mobility, banking professionals may experience technology failure or difficulties in accessing information services. This inability of the banking mobile professionals in utilising ICTs could have serious consequences in terms of risk on the bank operations and profit. The ICT-support call-centres play major roles in supporting the mobile user. This paper discusses how a global help desk unit accomplishes this role in a global banking organisation. This is achieved through analysis of the call tickets from the global helpdesk tracking system.
Scheduling divisible workloads on heterogeneous platforms
Authors: Olivier Beaumont, Arnaud Legrand, Yves Robert
Venue: Parallel Computing (2003)

In this paper, we discuss several algorithms for scheduling divisible workloads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the design of an asymptotically optimal multi-round algorithm. This multi-round algorithm automatically performs resource selection, a difficult task that was previously left to the user. Because it is periodic, it is simpler to implement, and more robust to changes in the speeds of the processors and/or communication links. On the theoretical side, to the best of our knowledge, this is the first published result assessing the absolute performance of a multi-round algorithm. On the practical side, extensive simulations reveal that our multi-round algorithm outperforms existing solutions on a large variety of platforms, especially when the communication-to-computation ratio is not very high (the difficult case).
A concurrency control protocol for nested transactions
Authors: Ming-Ling Lo, C. V. Ravishankar
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

Nested transactions [6, 5] provide fine grain atomicity, efficient recovery control, and structural modularity. In distributed environments, they provide a natural and semantically clean way of modeling computations. However, the characteristics of nested transactions are sufficiently different from those of traditional single-level transactions that concurrency control for nested transactions should be reconsidered in order to exploit all its advantages.In this paper, we investigate a new concurrency control protocol for nested transactions, and introduce the notion of a request list for that purpose. Our objectives are to provide shorter transaction turn-around times and better system throughput. These goals are accomplished by exploiting intra-transaction concurrency and by reducing the time a transaction has to wait for consistent data states.
Knowledge sharing in knowledge communities
Authors: Bart van den Hooff, Wim Elving, Jan Michiel Meeuwsen, Claudette Dumoulin
Venue: Communities and Technologies (2003)

This paper investigates the contribution of ICT to knowledge sharing in communities of practice. A theoretical model is built that identifies the possible influence of ICT on the extent to which knowledge is shared within a community, as well as a number of variables that determine the extent to which this contribution is realized. This theoretical model was tested within two ICT-facilitated communities for professionals in the area of working conditions. The results of these case studies show that ICT's most important contribution to knowledge sharing in communities consists of the realization of a shared information base (communality) and facilitating communication independent of time and place (connectivity). The results also show that trust among members of a community, and their identification with the community, are important influences on knowledge sharing. Task interdependence and the community's information culture are also identified as important influences.
Consistency and event ordering in the shared regions model
Authors: Harjinder S. Sandhu
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

The Shared Regions model introduces abstractions at the programming level that explicitly relate shared data with the synchronization primitives that guard access to that data. In this paper, we discuss consistency and event ordering in the Shared Regions model. We show that, using such a model, it is possible to relax the constraints on the ordering of memory operations beyond those possible in any of the previous memory consistency models. Additionally, we show that by taking advantage of the fact that synchronization events are labeled as readaccess or writeaccess in this model, the system can significantly improve concurrency by allowing a processor modifying some shared data to execute concurrently with processors reading that shared data. Some possible implementations exploiting the relaxed ordering constraints and increased concurrency are also discussed.
Telecommunication service description using state transition rules
Authors: Y. Hirakawa, T. Takenaka
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

For telecommunication software design, SDL[1,2] (Functional Specification Description Language) is conventionally used for specification descriptions. This article first clarifies difficulties of SDL description for supplementary services[3] which allow a conversation among an infinite number of customers, and where there is considerable service interaction behavior.Then, this article proposes a new telecommunication service description method, STR (State Transition Rule) method. In the proposed method, the service among an arbitrary number of customers can be defined easily, and declarative description is allowed for service interaction behavior in the early stage of software design. Also, this article clarifies a feature of the proposed descriptions, that monotonic increase of transition rules realizes easy service addition. Lastly, the analyzability of the proposed descriptions is discussed.
A Gibbs Point Process for Road Extraction from Remotely Sensed Images
Authors: Radu Stoica, Xavier Descombes, Josiane Zerubia
Venue: International Journal of Computer Vision (2004)

In this paper we propose a new method for the extraction of roads from remotely sensed images. Under the assumption that roads form a thin network in the image, we approximate such a network by connected line segments.To perform this task, we construct a point process able to simulate and detect thin networks. The segments have to be connected, in order to form a line-network. Aligned segments are favored whereas superposition is penalized. These constraints are enforced by the interaction model (called the Candy model). The specific properties of the road network in the image are described by the data term. This term is based on statistical hypothesis tests.The proposed probabilistic model can be written within a Gibbs point process framework. The estimate for the network is found by minimizing an energy function. In order to avoid local minima, we use a simulated annealing algorithm, based on a Monte Carlo dynamics (RJMCMC) for finite point processes. Results are shown on SPOT, ERS and aerial images.
Detecting context-differentiating terms using competitive learning
Authors: Travis L. Bauer, David B. Leake
Venue: ACM SIGIR Forum (2003)

Personal information agents monitor ongoing user information accesses in order to provide users with context-relevant information. Providing the needed information requires effective methods for identifying the user's task context, based on available information. For user browsing tasks, one approach to context identification is to extract context-determining terms from the documents that the user consults. The thesis of this article is (1) that term extraction for personal information agents can be done by learning terms whose occurrence frequencies have a large variance over time, (2) that indexing and retrieval based on these terms can be at least as effective as standard information retrieval techniques, and (3) that this information can be learned without comprehensive corpus analysis, making it suitable for use in personal information retrieval.We have developed an unsupervised term extraction algorithm, WordSieve, that learns individualized context-differentiating terms for document indexing and retrieval. This article presents a new version of WordSieve, compares its design and performance to our initial approach, and assesses its effectiveness for a controlled personal information retrieval task, compared to three common indexing techniques requiring statistics about the global corpus. In the experiments, the new version of WordSieve generates task-relevant indices of comparable or better quality to common indexing techniques, using only local information.
Analysis of Multi-Access Performance Based on Non-Period Chaotic Frequency Hopping Sequences
Authors: Zan Li, Yi Tie, Lijun Jin, Yilin Chang, Jueping Cai
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Based on the chaotic non-period frequency-hopping (FH) sequences, the paper suggests a kind of packet protocol for frequency-hopping networks. In theory, the performance of the packet error and the throughput of frequency-hopping multi-access (FHMA) network are derived, which shows that the ratio of the packet length M to the frequency-hopping points q is the most key parameter to determine the FHMA system performance under the condition of large user numbers. Computer simulation results of the logistic chaotic sequences are also included to support our development.