ppxscal/embedding_network huggingface dataset:
Overall Performance Assessment of Energy-Aware Cooperative Techniques Exploiting Multiple Description and Scalable Video Coding Schemes
Authors: Federico Albiero, Janne Vehkaperä, Marcos Katz, Frank Fitzek
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

In this paper we develop and analyze energy-efficient cooperative techniques for multimedia applications over wireless networks. The composite cellular-short-range network architecture is explored by using multiple description coding and scalable video coding schemes. In order to provide an overall and fair assessment of the schemes, different approaches are evaluated and discussed. The techniques are compared not only in terms of their energy gain with respect to noncooperative (autonomous) operation but also considering the quality of the delivered video signal.
Construction of Distributed Terminal Management System in Consideration of Hierarchical Subnet in Intranet
Authors: Eiji Sugino, Katsuyoshi Onodera, Norihisa Segawa, Jun Sawamoto
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

We have built a terminal management system that simplifies network management tasks and prevents inappropriate connections of terminals to the network. This system is allocated to every subnet and manages users and terminals there. It has capability to give permission for use of the network when a terminal that has been registered to another subnet is moved to a different subnet temporarily.
The present & future of Web3D
Authors: David Luebke
Venue: Proceedings of the 13th international symposium on 3D web technology (2008)

The Web3D concept has moved from a primarily academic enterprise to a commercial reality, and is poised to explode into a full-blown industry. But what shape will that industry take? The answer depends on the interplay of several converging trends that are fueling this growth. Increasing bandwidth makes remote rendering a reality. An ecosystem of content and "killer apps" has sprung up, catalyzed by massive multiplayer online games and more recently by social networking. Graphics hardware has made amazing strides in power and mobility. GPU computing has unleashed tremendous and ubiquitous computational horsepower in just the right place: at the edge. I will explore these trends, using examples drawn from commercial and academic efforts around the globe. Meanwhile, realities of commercial distribution have generated some growing pains and tough questions that I will discuss. Finally, looking through the lens of my own experience with real-time rendering, virtual tourism, GPU computing, and the GPU industry, I will speculate on the most important research problems facing Web3D researchers.
When–and how–can a cellular automaton be rewritten as a lattice gas?
Authors: Tommaso Toffoli, Silvio Capobianco, Patrizia Mentrasti
Venue: Theoretical Computer Science (2008)

Both cellular automata (CA) and lattice-gas automata (LG) provide finite algorithmic presentations for certain classes of infinite dynamical systems studied by symbolic dynamics; it is customary to use the terms 'cellular automaton' and 'lattice gas' for a dynamic system itself as well as for its presentation. The two kinds of presentation share many traits but also display profound differences on issues ranging from decidability to modeling convenience and physical implementability. Following a conjecture by Toffoli and Margolus, it had been proved by Kari that any invertible CA, at least up to two dimensions, can be rewritten as an isomorphic LG. But until now it was not known whether this is possible in general for noninvertible CA-which comprise ''almost all'' CA and represent the bulk of examples in theory and applications. Even circumstantial evidence-whether in favor or against-was lacking. Here, for noninvertible CA, (a) we prove that an LG presentation is out of the question for the vanishingly small class of surjective ones. We then turn our attention to all the rest-noninvertible and nonsurjective-which comprise all the typical ones, including Conway's 'Game of Life'. For these (b) we prove by explicit construction that all the one-dimensional ones are representable as LG, and (c) we present and motivate the conjecture that this result extends to any number of dimensions. The tradeoff between dissipation rate and structural complexity implied by the above results have compelling implications for the thermodynamics of computation at a microscopic scale.
The landscape's apprentice: lessons for place-centred design from grounding documentary
Authors: Nicola J Bidwell, Peta-Marie Standley, Tommy George, Vicus Steffensen
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

We propose that grounding documentaries can help designers to respond to non-western, non-urban spatial infrastructures. We describe locally-produced, in vivo video methods developed by indigenous Elders in Australia to persist and transfer their Traditional Knowledge and the specific use-case of a documentary on fire. The culturally-situated nature of the documentary exposes subtleties in a dialectic between models of space. The ontology embedded in the methods, and expressed by the documentary, has a spatiality and a belonging to place that profoundly differs from that typifying HCI's urban focus and many video methods used by designers to understand useage contexts. Grass-roots driven documentaries ground subsequent design by engaging designers in otherwise inaccessible truths about remote places, partly through the designer's sense of their own felt-life. The fire documentary reveals many general insights for design, such as the need to escape a singularly anthropocentric spatio-temporal approach in order to respond to the plurality of user experience.
Long cycles passing through a specified path in a graph
Authors: Kazuhide Hirohata
Venue: Journal of Graph Theory (1998)

For a graph G and an integer k $#8805; 1, let &zeta;k(G) = $min \{\sum ^{k}_{i=1}$ dG(vi): {v1, &hellip;, vk} is an independent set of vertices in G}. Enomoto proved the following theorem. Let s $#8805; 1 and let G be a (s + 2)-connected graph. Then G has a cycle of length $#8805; min{|V(G)|, &zeta;2(G) - s} passing through any path of length s. We generalize this result as follows. Let k $#8805; 3 and s $#8805; 1 and let G be a (k + s - 1)-connected graph. Then G has a cycle of length $#8805; min{|V(G)|, $\frac{2}{k}\sigma_{k}(G)$ - s} passing through any path of length s. &copy; 1998 John Wiley Sons, Inc. J. Graph Theory 29: 177184, 1998
Condition numbers for linear systems and Kronecker product linear systems with multiple right-hand sides
Authors: Haiming Zhang, Hua Xiang, Yimin Wei
Venue: International Journal of Computer Mathematics (2007)

In this paper we investigate linear systems with multiple right-handed sides in the form of AX=B and (A ⊗ B)X=C. We derive normwise, mixed and componentwise condition numbers for these linear systems. Examples are given to evaluate the tightness of the first-order perturbation bounds.
Asynchronous Neighbor Discovery: Finding Needles of Connectivity in Haystacks of Time
Authors: Prabal Dutta, David Culler, Scott Shenker
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

We present Disco, an asynchronous neighbor discovery and rendezvous protocol that allows two or more nodes operating their radios at low duty cycles (e.g. 1%) to discover and communicate with each other during opportunistic encounters and without any prior synchronization information. The key challenge is to operate the radio at a low duty cycle but still ensure that discovery is fast, reliable, and predictable over a range of operating conditions. Disco nodes pick a pair of prime numbers such that the sum of their reciprocals is equal to the desired radio duty cycle. Each node increments a local counter with a globally-fixed period. If a node's local counter value is divisible by either of its primes, then the node turns on its radio for one period. This protocol ensures that two nodes will have some overlapping radio on-time within a bounded number of periods, even if nodes independently set their own duty cycle.
Unit response matrix coefficients development: ANN approach
Authors: Saeed Alimohammadi, Abbas Afshar
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

The ANN methodology, inspired by neurobiology theories of massive interconnection and parallelism has been successfully employed in variety of optimization problems. In ground water management models, either governing equations are embedded into the management model or unit response matrixes are employed. Unit response matrixes development requires huge amount of data and/or simulation runs. In this paper, ANN is employed to develop unit response matrix coefficients to be later used in the management model. To do it, a ANN model has been trained to predict the outcome of the flow code, which results in unit response matrix coefficients for the aquifer under consideration. To train the ANN model different realizations from pumping well co-ordinates, distance between pumping and observation wells, and hydraulic conductivities of pumping wells were used, it was concluded that pumping well co-ordinates may be successfully employed for developing unit response matrix coefficients to be later used in management models. To test the performance of the proposed approach, the hypothetical aquifer was assumed. The aquifer response to different pumping stresses were compared using a well-defined simulation model and those resulted from unit response matrixes developed by (1) ANN approach and (2) direct data from groundwater simulation runs. It was concluded that ANN may be successfully employed for development of unit response matrix with limited data from field study or ground water simulation runs.
Optimizing the size of the sequence profiles to increase the accuracy of protein sequence alignments generated by profile–profile algorithms
Authors: Aleksandar Poleksic, Mark Fienup
Venue: Bioinformatics (2008)

Motivation: Profile-based protein homology detection algorithms are valuable tools in genome annotation and protein classification. By utilizing information present in the sequences of homologous proteins, profile-based methods are often able to detect extremely weak relationships between protein sequences, as evidenced by the large-scale benchmarking experiments such as CASP and LiveBench. Results: We study the relationship between the sensitivity of a profile–profile method and the size of the sequence profile, which is defined as the average number of different residue types observed at the profile's positions. We also demonstrate that improvements in the sensitivity of a profile–profile method can be made by incorporating a profile-dependent scoring scheme, such as position-specific background frequencies. The techniques presented in this article are implemented in an alignment algorithm UNI-FOLD. When tested against other well-established methods for fold recognition, UNI-FOLD shows increased sensitivity and specificity in detecting remote relationships between protein sequences. Availability: UNI-FOLD web server can be accessed at http://blackhawk.cs.uni.edu Contact: poleksic@cs.uni.edu
A 2 GHz variable gain low noise amplifier in 0.18-μm CMOS
Authors: Shaikh K. Alam, Joanne Degroat
Venue: Analog Integrated Circuits and Signal Processing (2008)

This paper describes a 2 GHz active variable gain low noise amplifier (VGLNA) in a 0.18-&mu;m CMOS process. The VGLNA provides a 50-Ω input impedance and utilizes a tuned load to provide high selectivity. The VGLNA achieves a maximum small signal gain of 16.8 dB and a minimum gain of 4.6 dB with good input return loss. In the high gain and the low gain modes, the NFs are 0.83 dB and 2.8 dB, respectively. The VGLNA's IIP3 in the high gain mode is 2.13 dBm. The LNA consumes approximately 4 mA of current from a 1.8-V power supply.
Modelling and prediction of GPS availability with digital photogrammetry and LiDAR
Authors: George Taylor, Jing Li, David Kidner, Chris Brunsdon, Mark Ware
Venue: International Journal of Geographical Information Science (2007)

This paper describes an automated method for predicting the number of satellites visible to a GPS receiver, at any point on the Earth's surface at any time. Intervisibility analysis between a GPS receiver and each potentially visible GPS satellite is performed using a number of different surface models and satellite orbit calculations. The developed software can work with various ephemeris data, and will compute satellite visibility in real time. Real-time satellite availability prediction is very useful for mobile applications such as in-car navigation systems, personal navigations systems and LBS. The implementation of the method is described and the results are reported.
SHIELD: a software hardware design methodology for security and reliability of MPSoCs
Authors: Krutartha Patel, Sri Parameswaran
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Security of MPSoCs is an emerging area of concern in embedded systems. Security is jeopardized by code injection attacks, which are the most common types of software attacks. Previous attempts to detect code injection in MPSoCs have been burdened with significant performance overheads. In this work, we present a hardware/software methodology "SHIELD" to detect code injection attacks in MPSoCs. SHIELD instruments the software programs running on application processors in the MPSoC and also extracts control flow and basic block execution time information for runtime checking. We employ a dedicated security processor (monitor processor) to supervise the application processors on the MPSoC. Custom hardware is designed and used in the monitor and application processors. The monitor processor uses the custom hardware to rapidly analyze information communicated to it from the application processors at runtime. We have implemented SHIELD on a commercial extensible processor (Xtensa LX2) and tested it on a multiprocessor JPEG encoder program. In addition to code injection attacks, the system is also able to detect 83% of bit flips errors in the control flow instructions. The experiments show that SHIELD produces systems with runtime which is at least 9 times faster than the previous solution. SHIELD incurs a runtime (clock cycles) performance overhead of only 6.6% and an area overhead of 26.9%, when compared to a non-secure system.
Differentiating conceptual modelling from data modelling, knowledge modelling and ontology modelling and a notation for ontology modelling
Authors: Tharam Dillon, Elizabeth Chang, Maja Hadzic, Pornpit Wongthongtham
Venue: Proceedings of the fifth on Asia-Pacific conference on conceptual modelling - Volume 79 (2008)

This paper considers conceptual modelling for three purposes namely data modelling, knowledge modelling and ontology modelling. It differentiates between the nature of the conceptual models for these three. It then proposes a representation suitable for ontology modelling.
AC/DC: an algorithm for cheating detection by cheating
Authors: Stefano Ferretti, Marco Roccetti
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

Time cheats represent some of the most crucial issues in online gaming. Since they act on timing properties of generated game events, these malicious schemes are particularly difficult to thwart when distributed games are deployed over peer-to-peer architectures. Indeed, the absence of a global clock shared among peers enables cheaters to see into the future by waiting for events generated by other peers before generating its own ones (lookahead cheat). This may give an unfair advantage to the cheater. We consider a version of lookahead cheat generalized in the context of real-time (i.e., not round-based) games. To face this time cheat, we present AC/DC, an Algorithm for Cheating Detection by Cheating. This algorithm enables to detect cheaters based on monitoring of network latencies. The basic idea is that of conducting against each suspected peer a sort of cheating counterattack, by delaying events before notifying them to the (hypothetic) cheater. This permits to detect whether that peer waits for these events before generating its own ones. Our claim is that an approach based on the monitoring of communication patterns among peers allows cheat detection without affecting the performances of the game.
Granulometric analyses of basin-wise DEMs: a comparative study
Authors: L. T. Tay, B. S. Daya Sagar, H. T. Chuah
Venue: International Journal of Remote Sensing (2007)

Digital elevation models (DEMs) are very useful for terrain characterization. We apply a morphological approach to characterize 14 sub-basins decomposed from interferometrically generated DEMs of Cameron Highlands and Petaling regions of Peninsular Malaysia. Physiographically, these two regions possess a distinct geomorphologic set-up as they belong to region with higher and lower altitudes, respectively. Fourteen sub-basins are extracted from the DEMs, and pattern spectra by opening and closing of these sub-basins relative to flat discrete binary patterns (square, octagon and rhombus) are computed. Pattern spectra are used to compute probability size distribution functions of both protrusions and intrusions that are conspicuous in topography, based on which shape-size complexity measures of these sub-basins are estimated by means of average roughness and size. Furthermore, fractal dimensions of channel networks derived from these 14 basins are computed by applying the box-counting method. Comparisons between shape-size complexity measures and fractal dimension are carried out.
A modular supervised algorithm for vessel segmentation in red-free retinal images
Authors: Andrea Anzalone, Federico Bizzarri, Mauro Parodi, Marco Storace
Venue: Computers in Biology and Medicine (2008)

In this paper, a supervised algorithm for vessel segmentation in red-free images of the human retina is proposed. The algorithm is modular and made up of two fundamental blocks. The optimal values of two algorithm parameters are found out by maximizing proper measures of performances (MOPs) able to evaluate from a quantitative point of view the results provided by the proposed algorithm. The choice of the MOP allows one to tailor the solution to the specific image features to be emphasized. The performances of the algorithm are compared with those of other methods described in the literature. The simulation results show a good trade-off between quality and processing speed times. For instance, in terms of the maximum average accuracy (MAA), K value, and specificity (SP), the best performance outcomes are 0.9587, 0.8069 and 0.9477, respectively.
The business of emerging display technologies
Authors: Paula Carson
Venue: Proceedings of the 2008 workshop on Immersive projection technologies/Emerging display technologiges (2008)

In the past decade we have experienced a revolution in display technology, in particular immersive display technologies, and a fast deployment of a wide range of commercial products, ranging from high-end one-of-a-kind multi-surface display, to productized displays for a larger customer base. As these technologies keep evolving and becoming more main stream, one would think that we would experience a growth in business opportunities for these technologies and a wider market for these technologies. However, the business of emerging displays technologies seems to be a niche market focused towards research environments and several specific narrow vertical markets. Furthermore, there seems to be a disconnection from the business of hardware technologies and software technologies to utilize these displays. This pane brings together a group of pioneer entrepreneurs in display technologies to share their experiences on developing businesses opportunities, to talk about their challenges, and to discuss needs and trends they see for the field.
The Compliance Game
Venue: Queue (2006)

Although complying with myriad regulations affecting information technology these days can feel like a chore, technology professionals now have an opportunity to leverage these efforts and create a proactive approach to IT governance. Tune into this month's Queuecast as Kris Lovejoy, CTO of Consul, discusses with host Mike Vizard why companies must shift their focus on compliance to a new governance approach that will ultimately better serve a company's needs. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Fast numerical method for the Boltzmann equation on non-uniform grids
Authors: Alexei Heintz, Piotr Kowalczyk, Richards Grzhibovskis
Venue: Journal of Computational Physics (2008)

We introduce a new fast numerical method for computing discontinuous solutions to the Boltzmann equation and illustrate it by numerical examples. A combination of adaptive grids for approximation of the distribution function and an approximate fast Fourier transform on non-uniform grids for computing smooth terms in the Boltzmann collision integral is used.
Harnessing user contributions and dynamic profiling to better satisfy individual information search needs
Authors: Roman Y. Shtykh, Qun Jin
Venue: International Journal of Web and Grid Services (2008)

In the situation of information overload we are experiencing today, conventional web search systems taking a one-size-fits-all approach are often not capable of effectively satisfy individual information needs. To improve the quality of web information retrieval, we propose a collaborative personalised search approach that makes an attempt to 'understand' and better satisfy the information needs for each and every searching user. We present a web information retrieval framework called Better Search and Sharing (BESS) that captures user-system interactions, profiles them and induces personal interests that changes over time with an interest-change-driven profiling mechanism that is also extensively used for the co-evaluation of documents found valuable inside a specific search context by users with similar interests.
A Comparative Study of RFID Solutions for Security and Privacy: POP vs. Previous Solutions
Authors: Krishan Sabaragamu Koralalage, Jingde Cheng
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

In a true ubiquitous world, RFID tags will be available in everything, everywhere, and at all times. However, since those tags are bounded with constraints, with no foolproof method to manage the changing hands of the same-tagged item, there is no assurance of privacy and security in passive tags. Yet there are several vender specific solutions but none of them comprehensively solve the security risks and privacy threats arise in the domain of product lifecycle. Thus, there is a need to recognize a standard solution at least for a specific domain. Therefore we proposed the POP Method that comprehensively solves the problems arising in the domain of product lifecycle. In this paper, we compare and contrast the available major solutions against the POP method. We first provide evaluation criteria, and then we survey major proposed solutions, including ours. Next, we present the evaluation results addressing the security and privacy together with the functional aspects. Finally, we conclude the paper by realizing the best available solution for the product lifecycle with passive tags.