ppxscal/embedding_network huggingface dataset:
Generated Horizontal and Vertical Data Parallel GCA Machines for the N-Body Force Calculation
Authors: Johannes Jendrsczok, Rolf Hoffmann, Thomas Lenck
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

The GCA model (Global Cellular Automata) is a massively parallel computation model which is a generalization of the Cellular Automata model. A GCA cell contains data and link information. Using the link information each cell has dynamic read access to any global cell in the field. The data and link information is updated in every generation. The GCA model is applicable and efficient for a large range of parallel algorithms (sorting, vector reduction, graph algorithms, matrix computations etc.). In order to describe algorithms for the GCA model the experimental language GCAL was developed. GCAL programs can be transformed automatically into a data parallel architecture (DPA). The paper presents for the N-body problem how the force calculation between the masses can be described in GCAL and synthesized into a data parallel architecture. At first the GCAL description of the application is transformed into a Verilog description which is inserted into a Verilog template describing the general DPA. Then the whole Verilog code is used as input for an FPGA synthesizing tool which generates the application-specific DPA. Two different DPAs are generated, a "horizontal" and a "vertical" DPA. The horizontal DPA uses 17 floating-point operators in each deep pipeline. In contrast the "vertical" DPA uses only one floating-point operation at a time out of a set of 6 floating-point operators. Both architectures are compared to resource consumption, time per cell operation and cost (logic elements * execution time). It turned out that the horizontal DPA is approximately 15 times more cost efficient than the vertical DPA.
A survey of platforms for mobile networks research
Authors: Earl Oliver
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2009)

The use of smartphones is growing at an unprecedented rate and is projected to soon pass laptops as consumers' mobile platform of choice. The proliferation of these devices has created new opportunities for mobile researchers; however, when faced with hundreds of devices across nearly a dozen development platforms, selecting the ideal platform is often met with unanswered questions. In this paper I consider desirable characteristics of mobile platforms necessary for mobile networks research. Based on these characteristics, I assess five smartphone platforms: Android (Linux), BlackBerry, iPhone (Mac OS X), Symbian, and Windows Mobile. This survey is current as of December 2008. A living version of this survey is available at: http://blizzard.cs.uwaterloo.ca/eaoliver/platforms/.
Governments Experiment with New Fiber Network Models
Authors: Greg Goth
Venue: IEEE Internet Computing (2009)

Governments are testing last-mile broadband infrastructure improvements as economic stimulus, including private ownership models. The idea has faced some challenges from current service providers.
Improved bounds on the average distance to the Fermat--Weber center of a convex object
Authors: A. Karim Abu-Affash, Matthew J. Katz
Venue: Information Processing Letters (2009)

We show that for any convex object Q in the plane, the average distance between the Fermat-Weber center of Q and the points in Q is at least 4@D(Q)/25, and at most 2@D(Q)/(33), where @D(Q) is the diameter of Q. We use the former bound to improve the approximation ratio of a load-balancing algorithm of Aronov et al. [B. Aronov, P. Carmi, M.J. Katz, Minimum-cost load-balancing partitions, Algorithmica, in press].
Compositionality of Model Transformations
Authors: Dénes Bisztray, Reiko Heckel, Hartmut Ehrig
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Model transformations can be used not only for code or platform-specific model generation, but also for denotational semantics definition, e.g. using process algebras as semantics for visual modeling languages. Denotational semantics of programming languages are by definition compositional. In order to enjoy a similar property in the case of model transformations, every component of the source model should be distinguishable in the target model and the mapping compatible with syntactic and semantic composition. Since typed graphs are a natural representation of visual models, model transformations are often described by typed graph transformations. This paper proposes a formal definition of compositionality for mappings from typed graphs to semantic domains. To verify compositionality, syntactic criterion has been established for the implementation of the mappings by graph transformations with negative application conditions. An example compositional transformation is presented that maps architectural models described in UML component diagrams to CSP.
The hipdiskettes: learning (through) wearables
Authors: Danielle Wilde
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

Physically engaging wearable interfaces offer a new means of self-expression. They help us move beyond our reliance on linguistics by supporting more open, dynamic and fluid forms of expression that are pre-verbal, that originate in the body. Our research suggests that they also present untapped potential for learning about how different people learn. We investigate this idea through the learning process of the hipdiskettes, a group of performers working with the hipDisk wearable musical interface. Examples from the initial rehearsal periods are presented, noting the learning affordances provided by the interface, learning supports provided by the developer, and the different needs and approaches over time of the performers. Investigating learning was not the focus of the hipDisk research yet outcomes suggest that a consideration of how different people learn through, and about, their bodies is beneficial to the development of physically engaging wearables.
Analyzing Voice Quality in Popular VoIP Applications
Authors: Batu Sat, Benjamin W. Wah
Venue: IEEE MultiMedia (2009)

This article presents a technique for comparing the speech quality of VoIP systems on networks suffering from congestion.
Constructive learning neural network applied to identification and control of a fuel-ethanol fermentation process
Authors: Luiz Augusto da Cruz Meleiro, Fernando José Von Zuben, Rubens Maciel Filho
Venue: Engineering Applications of Artificial Intelligence (2009)

In the present work, a constructive learning algorithm was employed to design a near-optimal one-hidden layer neural network structure that best approximates the dynamic behavior of a bioprocess. The method determines not only a proper number of hidden neurons but also the particular shape of the activation function for each node. Here, the projection pursuit technique was applied in association with the optimization of the solvability condition, giving rise to a more efficient and accurate computational learning algorithm. As each activation function of a hidden neuron is defined according to the peculiarities of each approximation problem, better rates of convergence are achieved, guiding to parsimonious neural network architectures. The proposed constructive learning algorithm was successfully applied to identify a MIMO bioprocess, providing a multivariable model that was able to describe the complex process dynamics, even in long-range horizon predictions. The resulting identification model was considered as part of a model-based predictive control strategy, producing high-quality performance in closed-loop experiments.
Access delay in LonTalk MAC protocol
Authors: Marek Mikowicz
Venue: Computer Standards Interfaces (2009)

The study deals with the analysis of latency introduced by the media access control algorithm of LonTalk protocol registered as ANSI/CEA-709.1 standard and used in LonWorks control networking technology. The LonTalk protocol provides multicast communication which is a distinctive feature among control network protocols. The predictive p-persistent CSMA protocol built in the MAC sublayer uses the memoryless backoff, additive increase/additive decrease contention window adjustments, provides collision avoidance and optional collision detection. The behavior of the LonTalk MAC protocol, unlike of the other CSMA schemes, is forced not only by the traffic rate but also by the structure of the workload transmitted through the channel. Therefore, the predictive p-persistent CSMA performance depends on the load scenario defined as the specification of the input traffic generated to the network. In the study, a unified method of load scenario definition integrating various addressing and message service types, is used. The contribution of the paper is the adaptation of the analytical approach based on Markov chains to the evaluation of mean access delay of LonTalk protocol for any load scenario.
A pilot study of meaning of information in information systems based on Heidegger's work on 'being'
Authors: Ping Cang, Sufen Wang
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

There appear many inconsistent and often conflicting views and terms for information, data and meaning in the field of information systems, the kind of confusion is resulted in by lacking of an appropriate understanding of meaning. The paper argues that meaning is created through interpretation, and the subject of an interpretation activity. So, We draw on Heidegger's work on 'being' to investigate the being-structure and essential characteristics of information-literate knowledge worker in the process of information realization with which to understand the essence of inter-subjective meaning and subjective meaning. The paper elicits that meaning is the link between information and data. The realization of meaning of information embodies the ability with which interpreter is able to understand or interpret the information, viz. the horizon of interpretation. Therefore, the investigation would seem highly desirable and important both for theoretic research and practice.
Computing prior to FORTRAN
Authors: R. W. Bemer
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The life of the programmer in pre-FORTRAN days is characterized in modern terminology, indicating how strongly FORTRAN has changed the programmer's condition and working habits.
Note: A best online algorithm for scheduling on two parallel batch machines
Authors: Ji Tian, Ruyan Fu, Jinjiang Yuan
Venue: Theoretical Computer Science (2009)

We consider the online scheduling on two parallel batch machines with infinite batch size to minimize makespan, where jobs arrive over time. That is, all information of a job is not available until it is released. For this online scheduling problem, Nong et al. [Q.Q. Nong, T.C.E. Cheng, C.T. Ng, An improved online algorithm for scheduling on two unrestrictive parallel batch processing machines, Operations Research Letters, 36 (2008) 584-588] have provided an online algorithm with competitive ratio no greater than 2. We show that this bound is tight for the problem. Furthermore we give a new best possible online algorithm with a tighter structure.
Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology
Venue: ACM International Conference Proceeding Series; Vol. 352 (2008)

It is a great pleasure to welcome everyone to ACE 2008, an International Conference on Advances in Computer Entertainment Technology. Over the years, the conference has grown to be one of the most rigorous and intense academic conferences in the field of entertainment computing. We were pleased to see a large increase of submissions this year, which made the competition for full paper acceptance even more intense. This year's ACE is being held at a brand new building: the Collaboration Complex in Hiyoshi Campus of Keio University, and is located in the City of Yokohama, the Creative City. The goal of entertainment computing is to create a compelling and pleasurable experience. To achieve the goal, this year's ACE invited not only technical researchers, but also artists and designers, as well as theoreticians in entertainment-related fields. The ACE2008 Program Committee has assembled an excellent mix of technical papers, design papers, and theory/social impact papers, with invited talks on cutting edge research in the field of entertainment computing. In addition, the Creative Showcase is designed to reflect a collection of artistic, technological, and theoretical works that can be experienced through interactions.
Resource Allocation in Streaming Environments
Authors: Lu Tian, K. Chandy
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

This paper considers resource allocation algorithms for processing streams of events on computational grids. For example, financial trading applications are executed on large computational grids that receive streams of data such as stock ticker prices, commodity prices, foreign-exchange rates and total risk exposure. The economic value of a computation depends on the time taken to execute it; an arbitrage opportunity can disappear in seconds. Given limited resources, it is not possible to process all streams without delay. The more resource available to a computation, the less time it takes to process the input, and thus the more value it generates. Therefore, the scheduling policy should be designed to optimize the net economic value of computations executed on the grid. In this paper, we propose two scheduling/resource allocation algorithms for processing streams on computational grids to optimize economic value. Both algorithms are based on market mechanisms; one uses a centralized market and the other decentralized markets. We prove bounds on performance and present measurements to show that the performances of the resource allocation systems are near-optimal and outperform load-balancing heuristics.
Balance ball interface
Authors: Masasuke Yasumoto
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

A user-interface device for exercise and entertainment. As users move while sitting on the balance ball, the system captures their motion and behaviour.
A simulation model for data base system performance evaluation
Authors: Fumio Nakamura, Ikuzo Yoshida, Hidefumi Kondo
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Performance evaluation represents one of the most critical and also most complex aspects of the design of a data base system for operation in an on-line environment.
Uniform Uncertainty Principle and Signal Recovery via&#x00a0;Regularized Orthogonal Matching Pursuit
Authors: Deanna Needell, Roman Vershynin
Venue: Foundations of Computational Mathematics (2009)

This paper seeks to bridge the two major algorithmic approaches to sparse signal recovery from an incomplete set of linear measurements&#x2014;L1-minimization methods and iterative methods (Matching Pursuits). We find a simple regularized version of Orthogonal Matching Pursuit (ROMP) which has advantages of both approaches: the speed and transparency of OMP and the strong uniform guarantees of L1-minimization. Our algorithm, ROMP, reconstructs a sparse signal in a number of iterations linear in the sparsity, and the reconstruction is exact provided the linear measurements satisfy the uniform uncertainty principle.
The SkyplexNet, a new satellite network with traffic control and distributed network management
Authors: Giuseppe Tomasicchio
Venue: Space Communications (2000)

The SkyplexNet system, developed in the framework of an ARTES-3 line 1 ESA project, implements an innovative Ground Segment solution based on the &lsquo;Skyplex on-board multiplexer&rsquo;. The networking aspects related with the Skyplex technology, the TDMA operation mode, the DVB compliance and finally the bandwidth on-demand allocation scheme make SkyplexNet a cost effective satcom solution addressing properly the specific market. With reference to such features, this paper presents the technological aspects of an innovative Ground Segment architecture based on the &lsquo;Skyplex on-board multiplexer&rsquo;. The intrinsic capability of Skyplex to uplink several client stations operating in SCPC or TDMA, implies the need to define a clear overall paradigm to coordinate the access to the space resources as well as the control and management of the Skyplex network. In this paper an overall description of the SkyplexNet system and of the typical service exploitation scenarios for broadband multimedia services is given. A specific analysis on the traffic control paradigm and distributed network management architecture adopted in the satellite system is furtherly detailed.
Synthesis and nonlinear optical behavior of Ag nanoparticles in PMMA
Authors: M. Torres-Cisneros, Naohisa Yanagihara, B. Gonzalez-Rolon, M. A. Meneses-Nava, O. G. Ibarra-Manzano, D. A. May-Arrioja, J. Sánchez-Mondragón, E. Aguilera-Gómez, L. A. Aguilera-Cortés
Venue: Microelectronics Journal (2009)

In this work we have synthesized silver nanoparticles in Poly (methyl methacrylate) (PMMA). This was achieved by polymerizing the mixture of monomer and corresponding metal compound, followed by post-heating treatment. The linear absorption coefficient of the samples was measured using a spectrophotometer, where an absorption peak at 420nm was observed. This peak grows up and shifts as a function of the concentration of the radical initiator. The linear refractive index was measured using the Fresnel equations and agrees with previous reported results. The nonlinear properties were obtained using the single lens Z-scan method, where the nonlinear absorption coefficient (Δ&alpha;) was found between 5.5975514 and 17.9483493cm-1. The nonlinear refractive index coefficient (Δ&eta;) was found to be negative and its value oscillates between 12.9099 E-06 and 22.4276 E-06. Finally, the third-order coefficient (χ(3)) was calculated in the range of 233-787 E-9 esu.
Profiling and identification of P2P traffic
Authors: Yan Hu, Dah-Ming Chiu, John C. S. Lui
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Accurate identification of network applications is important for many network activities. The traditional port-based technique has become much less effective since many new applications no longer use well-known fixed port numbers. In this paper, we propose a novel profile-based approach to identifying traffic flows belonging to the target application. In contrast to the method used in previous studies, of classifying traffic based on statistics of individual flows, we build behavioral profiles of the target application, which describe dominant patterns in the application. Based on the behavior profiles, a two-level matching method is used to identify new traffic. We first determine whether a host participates in the target application by comparing its behavior with the profiles. Subsequently, we compare each flow of the host with those patterns in the application profiles to determine which flows belong to this application. We demonstrate the effectiveness of our method on-campus traffic traces. Our results show that one can identify popular P2P applications with very high accuracy.
The Research of Collision Detection Algorithm Based on Spatial Subdivision
Authors: Hanjun Jin, Zhiliang Liu, Tianzhen Wu, Yanxia Wang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Interactive environments for dynamically deforming objects play an important role in virtual environment. These environments require fast and efficient collision detection handling techniques. In this paper, we propose a new collision detection algorithm based on spatial subdivision, which can solve the collision detection problems between deformable objects. The object space is uniformly subdivided into a series of voxels, and then determines whether collision detection will happen by constructing binary sort tree. Based on distribution density of objects, an optimal method is proposed to compute the size of voxels in uniform division, compared to other collision detection algorithm through a serial of tests, the results show that the algorithm this paper proposes is superior in performance when massive objects are uniformly distributed; Besides, the performance of algorithm is more stable than other algorithms in consideration of variable correlation among objects.
Constraint-Based Invariant Inference over Predicate Abstraction
Authors: Sumit Gulwani, Saurabh Srivastava, Ramarathnam Venkatesan
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

This paper describes a constraint-based invariant generation technique for proving the validity of safety assertions over the domain of predicate abstraction in an interprocedural setting. The key idea of the technique is to represent each invariant in bounded DNF form by means of boolean indicator variables, one for each predicate p and each disjunct d denoting whether p is present in d or not. The verification condition of the program is then encoded by means of a boolean formula over these boolean indicator variables such that any satisfying assignment to the formula yields the inductive invariants for proving the validity of given program assertions.This paper also describes how to use the constraint-based methodology for generating maximally-weak preconditions for safety assertions. An interesting application of maximally-weak precondition generation is to produce maximally-general counterexamples for safety assertions. We also present preliminary experimental evidence demonstrating the feasibility of this technique.
HQE: A hybrid method for query expansion
Authors: Lixin Han, Guihai Chen
Venue: Expert Systems with Applications: An International Journal (2009)

Query expansion methods have been extensively studied in information retrieval. This paper proposes a query expansion method. The HQE method employs a combination of ontology-based collaborative filtering and neural networks to improve query expansion. In the HQE method, ontology-based collaborative filtering is used to analyze semantic relationships in order to find the similar users, and the radial basis function (RBF) networks are used to acquire the most relevant web documents and their corresponding terms from these similar users' queries. The method can improve the precision and only requires users to provide less query information at the beginning than traditional collaborative filtering methods.
Differential recursion
Authors: Akitoshi Kawamura
Venue: ACM Transactions on Computational Logic (TOCL) (2009)

We present a redevelopment of the theory of real-valued recursive functions that was introduced by C. Moore in 1996 by analogy with the standard formulation of the integer-valued recursive functions. While his work opened a new line of research on analog computation, the original paper contained some technical inaccuracies. We discuss possible attempts to remove the ambiguity in the behavior of the operators on partial functions, with a focus on his &ldquo;primitive recursive&rdquo; functions generated by the differential recursion operator that solves initial value problems. Under a reasonable reformulation, the functions in this class are shown to be analytic and computable in a strong sense in computable analysis. Despite this well-behavedness, the class turns out to be too big to have the originally purported relation to differentially algebraic functions, and hence to C. E. Shannon's model of analog computation.