ppxscal/embedding_network huggingface dataset:
On the Design of a Language for Programming Real-Time Concurrent Processes
Authors: H. A. Schutz
Venue: IEEE Transactions on Software Engineering (1979)

ILIAD is a high-evel language for programming real-time applications which involve concurrent processing. It was designed to help scientists and engineers write reliable programs that can be read and maintained. An ILIAD program consists of a group of concurrent tasks. The tasks are autonomous and must cooperate in using the shared memory and devices in the execution environment. The language has facilities for providing secure access to these resources and for creating and synchronizing parallel instruction streams. In providing an overview of the language, the factors motivating the major design choices are discussed. A programming example illustrates how ILIAD might be applied. An assessment of the language includes a discussion of potential problem areas, both technical and nontechnical.
Holograph Interferomatery for Modelling Rate Change of Shoreline from Airsar Data
Authors: Maged Marghany, Mazlan Hashim, Arthur P. Cracknell
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

This work is introducing a new approach for modeling shoreline change rate from AIRSAR Cvvband. The hologram algorithm has been applied to simulate the wave spectra propagation pattern. In addition, Doppler frequency and azimuth cut off models are used to model longshore current movement and rate change of sediment transport volume. The results show that the phase information of AIRSAR hologram image can be used to simulate the wave refraction pattern. Furthermore, the Shoreline change rate is less than -0.5m /day which indicates an erosion event with accuracy error of ± 0.05 m/day.
A Lorentzian stochastic estimation for a robust iterative multiframe super-resolution reconstruction with Lorentzian-Tikhonov regularization
Authors: V. Patanavijit, S. Jitapunkul
Venue: EURASIP Journal on Advances in Signal Processing (2007)

Recently, there has been a great deal of work developing super-resolution reconstruction (SRR) algorithms. While many such algorithms have been proposed, the almost SRR estimations are based on L1 or L2 statistical norm estimation, therefore these SRR algorithms are usually very sensitive to their assumed noise model that limits their utility. The real noise models that corrupt the measure sequence are unknown; consequently, SRR algorithm using L1 or L2 norm may degrade the image sequence rather than enhance it. Therefore, the robust norm applicable to several noise and data models is desired in SRR algorithms. This paper first comprehensively reviews the SRR algorithms in this last decade and addresses their shortcomings, and latter proposes a novel robust SRR algorithm that can be applied on several noise models. The proposed SRR algorithm is based on the stochastic regularization technique of Bayesian MAP estimation by minimizing a cost function. For removing outliers in the data, the Lorentzian error norm is used for measuring the difference between the projected estimate of the high-resolution image and each low-resolution image. Moreover, Tikhonov regularization and Lorentzian-Tikhonov regularization are used to remove artifacts from the final answer and improve the rate of convergence. The experimental results confirm the effectiveness of our method and demonstrate its superiority to other super-resolution methods based on L1 and L2 norms for several noise models such as noiseless, additive white Gaussian noise (AWGN), poisson noise, salt and pepper noise, and speckle noise.
Into the Future
Authors: Paul F. Dubois
Venue: Computing in Science and Engineering (2007)

Columnist Paul F. Dubois talks about his retirement and some of the cool new technologies he's recently experienced.
Automatic generation of generic Bitstream Syntax Descriptions applied to H.264/AVC SVC encoded video streams
Authors: Davy Van Deursen, Wesley De Neve, Davy De Schrijver, Rik Van de Walle
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In order to create a media resource adaptation engine that supports current and future coding formats, a generic (i.e., format-agnostic) solution is needed. One way to realize this is to rely on automatically created textual descriptions of the high-level syntax of binary media resources, which can be used to steer the adaptation of media resources. MPEG-21 generic Bitstream Syntax Schema (gBS Schema) is a tool that enables the use of format-agnostic textual descriptions or generic Bitstream Syntax Descriptions (gBSDs). This paper introduces gBFlavor, a novel solution for the automatic generation of gBSDs. It offers the possibility to automatically generate a format-specific parser that is able to produce a gBSD for a given media resource. In this paper, the use of gBFlavor is demonstrated for the generation of gBSDs for H.264/AVC SVC compliant bitstreams. Performance results show that the proposed solution outperforms existing techniques in terms of execution speed.
Beyond the lan: techniques from network games for improving groupware performance
Authors: Jeff Dyck, Carl Gutwin, T. C. Nicholas Graham, David Pinelle
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Networked games can provide groupware developers with important lessons in how to deal with real-world networking issues such as latency, limited bandwidth and packet loss. Games have similar demands and characteristics to groupware, but unlike the applications studied by academics, games have provided production-quality real-time interaction for many years. The techniques used by games have not traditionally been made public, but several game networking libraries have recently been released as open source, providing the opportunity to learn how games achieve network performance. We examined five game libraries to find networking techniques that could benefit groupware; this paper presents the concepts most valuable to groupware developers, including techniques to deal with limited bandwidth, reliability, and latency. Some of the techniques have been previously reported in the networking literature; therefore, the contribution of this paper is to survey which techniques have been shown to work, over several years, and then to link these techniques to quality requirements specific to groupware. By adopting these techniques, groupware designers can dramatically improve network performance on the real-world Internet.
Influencing social dynamics in meetings through a peripheral display
Authors: Janienke Sturm, Olga Houben-van Herwijnen, Anke Eyck, Jacques Terken
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

We present a service providing real-time feedback to participants of small group meetings on the social dynamics of the meeting. The service measures and visualizes properties of participants' behaviour that are relevant to the social dynamics of the meeting: speaking time and gaze behaviour. The dynamic visualization is offered to meeting participants during the meeting through a peripheral display. Whereas an initial version was evaluated using wizards to obtain the required information about gazing behaviour and speaking activity instead of perceptual systems, in the current paper we employ a system including automated perceptual components. We describe the system properties and the perceptual components. The service was evaluated in a within-subjects experiment, where groups of participants discussed topics of general interest, with a total of 82 participants. It was found that the presence of the feedback about speaking time influenced the behaviour of the participants in such a way that it made over-participators to behave less dominant and under-participators to become more active. Feedback on eye gaze behaviour did not affect participants' gazing behaviour (both for listeners and for speakers) during the meeting.
Capacity planning and scheduling in Grid computing environments
Authors: Ali Afzal, A. Stephen McGough, John Darlington
Venue: Future Generation Computer Systems (2008)

Grid computing infrastructures embody a cost-effective computing paradigm that virtualises heterogeneous system resources to meet the dynamic needs of critical business and scientific applications. These applications range from batch processes and long-running tasks to real-time and even transactional applications. Grid computing environments are inherently dynamic and unpredictable environments sharing services amongst many different users. Grid schedulers aim to make the most efficient use of Grid resources (high utilisation) while providing the best possible performance to the Grid applications (reducing makespan) and satisfying the associated performance and Quality of Service (QoS) constraints. Additionally, in commercial Grid settings where economic considerations are an increasingly important part of Grid scheduling, it is necessary to minimise the cost of application execution on the behalf of the Grid users while ensuring that the applications meet their QoS constraints. Furthermore, efficient resource allocation may allow a resource broker to maximise their profit by minimising the quantity of resource procurement. Scheduling in such a large-scale, dynamic and distributed environment is a complex undertaking. In this paper, we propose an approach to Grid scheduling which abstracts over the details of individual applications, focusing instead on the global cost optimisation problem while taking into account the entire workload, dynamically adjusting to the varying service demands. Our model places particular emphasis on the stochastic and unpredictable nature of the Grid, leading to a more accurate reflection of the state of the Grid and hence more efficient and accurate scheduling decisions.
Multimedia Environment for Mobile Learning
Authors: Danco Davcev, Slobodan Kalajdziski, Kire Trivodaliev
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

This paper introduces our approach in building multimedia learning environment based on digital library and mobile student services. The learning material can be accessed from standard desktop PCs, but also from wireless PDA or mobile phones. The last two approaches require development of a mobile distance educational system, especially a mobile access to the digital library. We will show the functionalities of the digital library system installed on the technical sub-campus of our University. The functionalities of the virtual table (as one of the student services) and their integration into our multimedia learning environment will also be presented. The evaluation of this learning environment showed that the first experiences by the students are positive, and that both wired and wireless access to this kind of multimedia learning environment is suitable for engineering education.
Visualizing the marrow of science
Authors: SCImago Group: Félix de Moya-Anegón, Benjamín Vargas-Quesada, Zaida Chinchilla-Rodríguez, Elena Corera-Álvarez, Francisco J. Munoz-Fernández, Victor Herrero-Solana
Venue: Journal of the American Society for Information Science and Technology (2007)

This study proposes a new methodology that allows for the generation of scientograms of major scientific domains, constructed on the basis of cocitation of Institute of Scientific Information categories, and pruned using PathfinderNetwork, with a layout determined by algorithms of the spring-embedder type (Kamada&ndash;Kawai), then corroborated structurally by factor analysis. We present the complete scientogram of the world for the Year 2002. It integrates the natural sciences, the social sciences, and arts and humanities. Its basic structure and the essential relationships therein are revealed, allowing us to simultaneously analyze the macrostructure, microstructure, and marrow of worldwide scientific output. &copy; 2007 Wiley Periodicals, Inc.
Quality of service based resource allocation for scheduled lightpath demands
Authors: A. Jaekel, Y. Chen
Venue: Computer Communications (2007)

In this paper, we consider resource allocation under the scheduled traffic model, where the setup and teardown times of scheduled demands are known in advance. A number of integer linear program (ILP) solutions for this problem have been presented in the literature. Most of these ILPs minimize the number of wavelength links. A more appropriate metric, for wavelength routed, all-optical networks, is to minimize the congestion (the maximum number of lightpaths on a single fiber link) of the network. We present a new ILP formulation for routing and wavelength allocation, under the scheduled traffic model that minimizes the congestion of the network. We propose two levels of service, where idle backup resources can be used to carry low-priority traffic, under fault-free conditions. When a fault occurs, and resources for a backup path need to be reclaimed, any low-priority traffic on the affected channels is dropped. The results demonstrate that this can lead to significant improvements over single service level models. We also show that the complexity of our formulation (in terms of the number of integer variables) is lower, even compared to existing approaches, which only allow a single level of service. Therefore, we are able to generate optimal solutions for practical networks within a reasonable amount of time, whereas existing formulations often do not find the optimal solution even after 2h. Finally, we present a simple and fast heuristic that can quickly generate good solutions for much larger networks.
Secure two-party k-means clustering
Authors: Paul Bunn, Rafail Ostrovsky
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

The k-Means Clustering problem is one of the most-explored problems in data mining to date. With the advent of protocols that have proven to be successful in performing single database clustering, the focus has shifted in recent years to the question of how to extend the single database protocols to a multiple database setting. To date there have been numerous attempts to create specific multiparty k-means clustering protocols that protect the privacy of each database, but according to the standard cryptographic definitions of "privacy-protection," so far all such attempts have fallen short of providing adequate privacy. In this paper we describe a Two-Party k-Means Clustering Protocol that guarantees privacy, and is more efficient than utilizing a general multiparty "compiler" to achieve the same task. In particular, a main contribution of our result is a way to compute efficiently multiple iterations of k-means clustering without revealing the intermediate values. To achieve this, we show two techniques: to perform two-party division and to sample uniformly at random from an unknown domain size; the resulting Division Protocol and Random Value Protocol are of use to any protocol that requires the secure computation of a quotient or random sampling. Our techniques can be realized based on the existence of any semantically secure homomorphic encryption scheme. For concreteness, we describe our protocol based on Paillier Homomorphic Encryption scheme (see [21]). We will also demonstrate that our protocol is efficient in terms of communication, remaining competitive with existing protocols (such as [13]) that fail to protect privacy.
Quantum Search Tuning ANFIS/NGARCH for Analysis of Timing of Resources Exploration In The Behavior of Firm
Authors: Hsiu Fen Tsai, Bao Rong Chang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

We have insight into the importance of resource exploration; however, we really do not know when the firm will seriously commit to this kind of activities. Thus, an intelligence-based model, using logarithmic search with quantum existence testing (LSQET) to tune a composite model of adaptive neuron-fuzzy inference system (ANFIS) and nonlinear generalized autoregressive conditional heteroscedasticity (NGARCH), is proposed to constitute the relationship among five indicators of behavior of firm. Meanwhile, the performance summary among several alternative methods is compared quantitatively.
Efficient MD Coding Core Selection to Reduce the Bandwidth Consumption
Authors: Sunoh Choi, Sang-Seon Byun, Chuck Yoo
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming includes a redundant information, which results in additional bandwidth consumptions in entire distribution trees. In this paper, we deploy core nodes in distribution tree, and give a role of MD coding to each core node, instead of a source node then we show how amount of bandwidth consumption can be reduced. Since the problem of finding an optimal set of core nodes is proved to be NP-hard, an intuitional heuristic-based algorithm is proposed. The simulation results show that our heuristic algorithm reduces the bandwidth consumptions by about 25% in the hierarchical topology compared to the MD coding in source node only.
The general form linearizer algorithms: A new family of approximate mean value analysis algorithms
Authors: Hai Wang, Kenneth C. Sevcik, Giuseppe Serazzi, Shouhong Wang
Venue: Performance Evaluation (2008)

Approximate Mean Value Analysis (AMVA) is a popular technique for analyzing queueing network models due to the accuracy and efficiency that it affords. Currently, there is no algorithm that is more accurate than, and yet has the same computational cost as, the Linearizer algorithm, one of the most popular among different AMVA algorithms that trade off accuracy and efficiency. In this paper, we present a new family of AMVA algorithms, termed the General Form Linearizer (GFL) algorithms, for analyzing product-form queueing networks. The Linearizer algorithm is a special instance of this family. We show that some GFL algorithms yield more accurate solutions than, and have the same numerical properties and computational complexities as, the Linearizer algorithm. We also examine the numerical properties and computational costs of different implementations of the new and existing AMVA algorithms.
Gambit: An Interactive Database Design Tool for Data Structures, Integrity Constraints, and Transactions
Authors: R. P. Braegger
Venue: IEEE Transactions on Software Engineering (1985)

The design of a database is a rather complex and dynamic process that requires comprehensive knowledge and experience. There exist many manual design tools and techniques, but the step from a schema to an implementation is still a delicate subject. The interactive database design tool Gambit supports the whole process in an optimal way. It is based on an extended relational-entity relationship model. The designer is assisted in outlining and describing data structures and consistency preserving update transactions. The constraints are formulated using the database programming language Modula/R which is based upon first-order predicate calculus. The update transactions are generated automatically as Modula/R programs and include all defined integrity constraints. They are collected in so-called data modules that represent the only interface to the database apart from read operations. The prototype facility of Gambit allows the designer to test the design of the database. The results can be used as feedback leading to an improvement of the conceptual schema and the transactions.
Private web search
Authors: Felipe Saint-Jean, Aaron Johnson, Dan Boneh, Joan Feigenbaum
Venue: Proceedings of the 2007 ACM workshop on Privacy in electronic society (2007)

Web search is currently a source of growing concern about personal privacy. It is an essential and central part of most users' activity online and therefore one through which a significant amount of personal information may be revealed.To help users protect their privacy, we have designed and implemented Private WebSearch (PWS), a usable client-side tool that minimizes the information that users reveal to a search engine. Our tool protects users against attacks that involve active components and timing information, to which more general Web-browsing privacy tools (including the combination of FoxTor and Privoxy) are vulnerable. PWS is a Firefox plugin that functions as an HTTP proxy and as a client for the Tor anonymity network. It configures Firefox so that search queries executed from the PWS search box are routed through the HTTP proxy and Tor client, filtering potentially sensitive or identifying components of the request and response.
Research on the RAW Dependency in Floating-point FFT Processors
Authors: Shengmei Mou, Xiaodong Yang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The appearance of floating-point FFT processors and introduction of multiple butterfly units and high-radix structure increase the possibility of read-after-write (RAW) dependency between adjacent stages. The less the transform length is, the more butterfly units are used, the more cycles the butterfly units cost, the more possibility of RAW dependency lurks. In this paper, taking radix-2 time decimation FFT processors for example, we define the minimum slack cycles for each stage, which provides a quantitative method to identify RAW dependencies in FFT processors of variable transform length, and put forward some proposals to reduce or erase RAW dependencies. The minimum slack cycles also indicates the numbers of waiting cycles should be inserted into each stage, which simplifies the design of control path in FFT processors. As to the situation of multiple butterfly units and high-radix structure, same ideas can be used.
Computer assisted decision making for new product introduction investments
Authors: A. Tiwari, K. Vergidis, Y. Kuo
Venue: Computers in Industry (2008)

Business strategy is currently largely defined by the way that an organisation interacts with its stanapproach for supporting new product introduction (NPI) investments. The proposed methodology combines the existing concepts of directional policy matrix and real options are combined to establish the novel real options matrix (ROM) that enables strategic decisions regarding NPI. ROM consists of nine regions based on company's competitive capabilities and business sector prospects. To address the fuzzy boundaries between the ROM regions a fuzzy expert system is developed and validated based on a historical case study of a petrochemical industry. The results indicate that ROM can provide a reliable guide within the particular context as the strategy that the company followed matched with the ROM recommendation. The results are encouraging and support further consideration of ROM regarding NPI decisions.
Twiki and wetpaint: two wikis in academic environments
Authors: Libby Hemphill, Jude Yew
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

This paper describes a community-based effort to preserve organizational knowledge and to orientate newcomers to a graduate school. It presents a very brief review of recent research on wiki use in corporate and organizational environments and initial data from two wiki implementation iterations within our academic community. We contrast use of a TWiki with that of a WetPaint wiki. Our data suggest that with low barriers to participation and a great deal of patience, wikis can be useful stores for community information and knowledge sharing.