ppxscal/embedding_network huggingface dataset:
Simultaneous Encryption/Compression of Images Using Alpha Rooting
Authors: Eric Wharton, Karen Panetta, Sos Agaian
Venue: Proceedings of the Data Compression Conference (2008)

Significant work has been done in the areas of image encryption and compression as two independent problems, yet the two areas are strongly interleaved and should be considered simultaneously. Consider that current practice in image processing generally uses encryption on compressed image data or attempts to compress data that has already been encrypted. However, it is generally seen that traditional encryption techniques degrades compression. In this paper, we propose a novel method which prepares an image for compression while simultaneously encrypting the image data. We perform this using the well known alpha rooting algorithm. By increasing the relative magnitudes of the DCT transform coefficients, we are able to simplify the image in a way which makes it indiscernible, while also higher compression ratios. We demonstrate encryption and compression performance using the independent group JPEG algorithm, showing compression ratios and error metrics including MSE and SSIM for a collection of images.
Toward Libraries for Real-Time Java
Authors: Trevor Harmon, Martin Schoeberl, Raimund Kirner, Raymond Klefstad
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Reusable libraries are problematic for real-time software in Java. Using Java's standard class library, for example, demands meticulous coding and testing to avoid response time spikes and garbage collection. We propose two design requirements for reusable libraries in real-time systems: worst-case execution time (WCET) bounds and worst-case memory consumption bounds. Furthermore, WCET cannot be known if blocking method calls are used. We have applied these requirements to the design of three Java-based prototypes: a set of collection classes, a networking stack, and trigonometric functions. Our prototypes show that reusable libraries can meet these requirements and thus be viable for real-time systems.
Enumerating the Saneblidze-Umble diagonal in Haskell (abstract only)
Authors: Mikael Vejdemo-Johansson
Venue: ACM Communications in Computer Algebra (2008)

In 2004, Saneblidze and Umble gave a construction of a diagonal on the permutahedron, thus providing important tools to several disciplines using the permutahedra and associated combinatorial polyhedra. There has since been a few, mostly unpublished, attempts at writing computer programs to perform the highly combinatorial construction. The author presents an implementation of the construction in the programming language Haskell: a language which allows one to write computer code that stays very close to the mathematical expression of the construction itself. The author wishes to emphasize the perceived naturality of translating mathematics into Haskell code by giving examples from this program. (Received July 25, 2007.
Image reversal revisited
Authors: F. C. M. J. M. van Delft, F. J. H. van der Kruis, H. H. A. J. Roosen, H. W. J. J. van de Laar
Venue: Microelectronic Engineering (2008)

Image reversal methods can be useful in those cases, where a resist of a specific tone is lacking particular desirable properties, e.g. etch resistance. Reversal of the image, e-beam written in Hydrogen SilsesQuioxane (HSQ), by a proper 'work around' method may result in a positive tone high resolution process with a high etch resistance, which is lacking in PMMA. HSQ patterns have already been reversed in tone by electroplating in between HSQ lines, and by chemical mechanical polishing (CMP) of silicon nitride or silicon oxide deposited on top of the HSQ patterns. The present paper shows the latest results in our continuous quest for such processes: a bi-layer to bi-layer image reversal method based on spin coating, CMP and Reactive Ion Etching (RIE). The achievable resolution depends on the original HSQ resolution, the anisotropy of the RIE process and the ability of the HSQ spin deposition or the CVD oxide process to fill the spaces in between the original bi-layer features. In this particular set-up, the resolution seems to be limited to 50nm. A general flowchart schedule is presented which clarifies the relation between various image reversal techniques, e.g. electroplating, CMP and lift-off.
Context-aware service composition: a methodology and a case study
Authors: Leire Bastida, Francisco Javier Nieto, Roberto Tola
Venue: Proceedings of the 2nd international workshop on Systems development in SOA environments (2008)

The need for defining flexible and dynamic composed services that can adapt to the execution environment in an easy and quick way brings a new challenge to service centric system development and use. In this article, we present an innovative, easy-to-handle solution that supports the development of self-configuring and context-aware compositions from design time to implementation level. We discuss the steps that the service integrators should follow to create context-aware service compositions and also introduce a composition platform that supports the lifecycle of dynamic compositions both at design-time and at runtime. In order to demonstrate that our approach enables the development of context-aware service composition, we focus on a real case study in the automotive and telecommunication domains, where the evaluation results may be useful to understand, supervise and improve our approach to support dynamic compositions.
Building a Pragmatic Semantic Web
Authors: Harith Alani, Peter Chandler, Wendy Hall, Kieron O'Hara, Nigel Shadbolt, Martin Szomszor
Venue: IEEE Intelligent Systems (2008)

Semantic Web technology facilitates large-scale integration and sharing of distributed data sources. Transferring this technology from the lab environment into the real world requires careful planning to ensure the technology continues to offer a cost-effective and practical service. The authors describe an approach for promoting Semantic Web technology to industrial and government organizations. They present two Semantic Web applications: one involving several parts of government and the public sector, and the other targeting the aviation industry. Their goal is to show these organizations how to practically and relatively cheaply adopt Semantic Web technology for the dissemination, sharing, and use of their data. The applications demonstrate examples of immediate benefit. This article is part of a special issue called Semantic Web Update.
Normal forms and Fatou-Bieberbach domains
Authors: Ralph W. Oberste-vorth
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

Hénon mappings have a rich history beginning with an attempt in 1969 to study the Lorenz differential equation by Poincaré sections. This quadratic family has been studied allowing complex numbers for the parameters and variables since 1985. We examine a connection between normal forms of complex Hénon mappings and Fatou-Bieberbach mappings.
A New Mining Algorithm Based on Frequent Item Sets
Authors: Yun Wen
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

A new mining algorithm has been put in this paper base on frequent item sets. When affair database and minimum support has changed, this new algorithm can get the new frequent item sets by scanning the undirected item set graph only one time. Its execute efficiency is improved distinctly compared to the traditional algorithm.
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
Authors: Haifeng Yu, Phillip B. Gibbons, Michael Kaminsky, Feng Xiao
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

Decentralized distributed systems such as peer-to-peer systems are particularly vulnerable to sybil attacks, where a malicious user pretends to have multiple identities (called sybil nodes). Without a trusted central authority, defending against sybil attacks is quite challenging. Among the small number of decentralized approaches, our recent SybilGuard protocol [42] leverages a key insight on social networks to bound the number of sybil nodes accepted. Although its direction is promising, SybilGuard can allow a large number of sybil nodes to be accepted. Furthermore, SybilGuard assumes that social networks are fast mixing, which has never been confirmed in the real world. This paper presents the novel SybilLimit protocol that leverages the same insight as SybilGuard but offers dramatically improved and near-optimal guarantees. The number of sybil nodes accepted is reduced by a factor of Theta(sqrt(n)), or around 200 times in our experiments for a million-node system. We further prove that SybilLimit’s guarantee is atmost a log n factor away from optimal, when considering approaches based on fast-mixing social networks. Finally, based on three large-scale real-world social networks, we provide the first evidence that real-world social networks are indeed fast mixing. This validates the fundamental assumption behind SybilLimit’s and SybilGuard’s approach.
Evaluating the effect of replacing CNK with linux on the compute-nodes of blue gene/l
Authors: Edi Shmueli, George Almasi, Jose Brunheroto, Jose Castanos, Gabor Dozsa, Sameer Kumar, Derek Lieber
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

The Blue Gene machines in production today run a small single-user, single-process kernel (CNK) having a limited functionality. Motivated by the desire to provide applications with a much richer operating environment, we evaluate the effect of replacing CNK with a standard Linux kernel on the compute nodes of Blue Gene/L. We show that with a relatively small amount of effort we were able to improve benchmark performance under Linux up to a level that is comparable to CNK.
Techniques for Early Package Closure in System-in-Packages
Authors: Santhosh Coimbatore Vaidyanathan, Amit Mangesh Brahme, Jairam Sukumar
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

The two main forces pushing package technologies to a new frontier are size and cost. The need of the hour is miniaturization, fuelled by rapidly growing complexity in the wireless phone market. CSP (Chip Scale Packaging) has already reached 100% and further miniaturization can be achieved only by 3D packaging techniques. Complex 3D packaging techniques having hit the roadmap, the SoC design is largely driven by the co-dice that are stacked and the package elements such as size, routing layers, ball count etc. wherein “package-die co-design” is extremely critical for on time product delivery. In fact, it is not surprising that a SoC’s floorplan is driven by package and “co-design” is an understatement. This paper highlights the importance of package-die co-design for early package closure in SIPs. Guidelines and solutions on the Periphery and package planning are included. Careabouts and tradeoffs when designing SIPs are also explained.
Extracting Alternative Splicing Information from Captions and Abstracts Using Natural Language Processing
Authors: Chia Yang Cheng, F. R. Hsu, Chuan Yi Tang
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Alternative splicing mechanisms provide protein diversity for cellular growth and development. In this research, we generate a database to descript alternative splicing in different circumstance from captions and abstracts in Open Access Journals by using natural language processing techniques. We useMedical Subject Headings(MeSH) to tag words, and extract the AS mechanism information by UMLS semantic network. In this database, AS information in genes on tissue-specificity, disease-related, developmental stage, functional implications, splicing type and species are contained
An environment to support multi-user interaction and cooperation for improving museum visits through games
Authors: Riccardo Dini, Fabio Paternò, Carmen Santoro
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

The availability of mobile and stationary devices opens up new challenges to support users in several contexts. Here we present a multi-device environment to support cooperation among museum visitors through games. In particular, we present a design and the associated implementation for using a combination of PDAs and public displays to enhance the learning experience in a museum setting by using game playing interactions. The basic assumption is to use the mobile devices for individual game play, and the situated displays for synchronized public views of shared game play; the individual game play contributes to the shared game.
Aspectual Feature Modules
Authors: Sven Apel, Thomas Leich, Gunter Saake
Venue: IEEE Transactions on Software Engineering (2008)

Two programming paradigms are gaining attention in the overlapping fields of software product lines (SPLs) and incremental software development (ISD). Feature-oriented programming (FOP) aims at large-scale compositional programming and feature modularity in SPLs using ISD. Aspect-oriented programming (AOP) focuses on the modularization of crosscutting concerns in complex software. While feature modules, the main abstraction mechanisms of FOP, perform well in implementing large-scale software building blocks, they are incapable of modularizing certain kinds of crosscutting concerns. This weakness is exactly the strength of aspects, the main abstraction mechanisms of AOP. In this article we contribute a systematic evaluation and comparison of FOP and AOP. It reveals that aspects and feature modules are complementary techniques. Consequently, we propose the symbiosis of FOP and AOP and aspectual feature modules (AFMs), a programming technique that integrates feature modules and aspects. We provide a set of tools that support implementing AFMs on top of Java and C++. We apply AFMs to a non-trivial case study demonstrating their practical applicability and to justify our design choices.
Designing a prosthetic memory to support software developers
Authors: Uri Dekel
Venue: Companion of the 30th international conference on Software engineering (2008)

about their activities and the resulting artifacts which helps them remain oriented, avoid omissions, and correctly use artifacts. When stored only in the developer's organic memory, this knowledge may degrade and cannot directly be shared with others. Its consistent externalization, however, is currently limited by production costs, indirect returns, and its limited saliency in contexts where it could be useful. In this work we propose a memory aid which strives to overcome these barriers, and reduce the resulting problems. Developers will provide short and raw subjective notes which will be associated with the code context but stored separately from it, allowing us to increase saliency via two novel presentations. The first, designed after human episodic memory, chronologically interleaves these subjective notes with an automatically-gathered record of the developer's objective activities. It virtually extends shorter-term memory, aiding with orientation and increasing the saliency of recent knowledge and reminders. The second, a contextual view, uses static dependencies and historical records to present notes which may be relevant to the developer's current context.
Ionospheric perturbations over Delhi caused by the 26 December 2004 Sumatra earthquake
Authors: H. N. Dutta, R. S. Dabas, Rupesh M. Das, Kavita Sharma, Bhupender Singh
Venue: International Journal of Remote Sensing (2007)

The death and destruction caused by the Sumatra earthquake on 26 December 2004 have once again jolted seismologists to find a reliable early warning system of an impending major earthquake. The F-region ionospheric parameters probed remotely by a digital ionosonde over Delhi (28.6° N, 77.2° E) have shown precursory signatures of 26 December 2004 Sumatra earthquake. Results indicate severe perturbations in foF2 and hmF2 several hours before the deadly earthquake. The wavelike perturbations in foF2 continued for several days after the event. It is important to note that this earthquake struck at a time when there were no solar or geomagnetic disturbances to cause any anomalous ionospheric changes.
A Framework for Extrusion Detection Using Machine Learning
Authors: Yan Lou, Jeffrey J. P. Tsai
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Machine learning deals with the issue of how to build programs that improve their performance at some task through experience. Machine learning algorithms have proven to be of great practical value in a variety of application domains. They are particularly useful for (a) poorly understood problem domains where little knowledge exists for the humans to develop effective algorithms; (b) domains where there are large databases containing valuable implicit regularities to be discovered; or (c) domains where programs must adapt to changing conditions. Not surprisingly, the field of cyber space turns out to be a fertile ground where many software security problems could be formulated as learning problems and approached in terms of learning algorithms. This paper deals with the subject of applying machine learning in extraction detection. In the paper, we present our research work on design and implementation of an extrusion detection system for information security of big companies. The result shows a potential in real-world applications.
Self-adaptive velocity particle swarm optimization for solving constrained optimization problems
Authors: Haiyan Lu, Weiqi Chen
Venue: Journal of Global Optimization (2008)

Particle swarm optimization (PSO) is originally developed as an unconstrained optimization technique, therefore lacks an explicit mechanism for handling constraints. When solving constrained optimization problems (COPs) with PSO, the existing research mainly focuses on how to handle constraints, and the impact of constraints on the inherent search mechanism of PSO has been scarcely explored. Motivated by this fact, in this paper we mainly investigate how to utilize the impact of constraints (or the knowledge about the feasible region) to improve the optimization ability of the particles. Based on these investigations, we present a modified PSO, called self-adaptive velocity particle swarm optimization (SAVPSO), for solving COPs. To handle constraints, in SAVPSO we adopt our recently proposed dynamic-objective constraint-handling method (DOCHM), which is essentially a constituent part of the inherent search mechanism of the integrated SAVPSO, i.e., DOCHM + SAVPSO. The performance of the integrated SAVPSO is tested on a well-known benchmark suite and the experimental results show that appropriately utilizing the knowledge about the feasible region can substantially improve the performance of the underlying algorithm in solving COPs.
Lips animation based on Japanese phoneme context for an automatic reading system with emotion
Authors: Futoshi Sugimoto, Masahide Yoneyama
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

We developed a lips animation system that is simple and suits the characteristics of Japanese. It adopts phoneme context that is usually used in speech synthesis. It only needs a small database that contains tracing data of movement of lips for each phoneme context. Through an experiment using subjects in which the subjects read a word from lips animation, we got result as correct as from real lips.
Design and Implementation of Adaptive Jini System to Support Undefined Services
Authors: Kohei Kadowaki, Takahiro Koita, Kenya Sato, Hiroshi Hayakawa
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

In recent years, various embedded devices, such as home appliances, mobile phones, and PDAs have become equipped with network functions for communication among themselves. Jini is a Java-based distributed object technology that allows distributed systems of components to exist on different hardware/software platforms. A Jini device cooperates with other Jini devices on a network using "services" Each service has a "programmatic" interface that defines the device's operations. To accomplish interactions a conventional Jini client needs a service interface for its required service when the software is built. Without software updates, a client cannot interact with a new device as "undefined services" that may appear in the future. In case of an embedded device with severe memory restriction, a client must contain all service interfaces to be used even if required services already exist on the network.In this research, we propose the Adaptive Jini system that can exploit undefined services without a predefined interface for them. In the system, a client does not need to know the individual interfaces for services in advance when the software is built. A client only needs to know a generic interface that defines the kind of services. A client can lookup and interact with the services by a generic interface. We designed and implemented printer and MP3 audio player services as example applications for the Adaptive Jini system. In addition, we evaluated the memory usage of each client device both on the Adaptive Jini and the conventional Jini system, and confirmed that our system is suitable for embedded devices.
Using cellular graph embeddings in solving all pairs shortest paths problems
Authors: G. N. Frederickson
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

An algorithm for generating a succinct encoding of all-pairs shortest path information in an n-vertex directed planar G with O(n) edges is presented. The edges have real-valued costs, but the graph contains no negative cycles. The time complexity is given in terms of a topological embedding measure defined in the paper. The algorithm uses a decomposition of the graph into outerplanar subgraphs satisfying certain separator properties, and a linear-time algorithm is presented to find this decomposition.
Multimodal Chinese text entry with speech and keypad on mobile devices
Authors: Yingying Jiang, Xugang Wang, Feng Tian, Xiang Ao, Guozhong Dai, Hongan Wang
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Chinese text entry is challenging on mobile devices which rely on keypad input. Entering one character may require many key presses. This paper proposes a multimodal text entry technique for Chinese. In this method, Chinese user can enter Chinese text by simultaneously using the simplified phonemic input method named Jianpin with keypad and speech utterance. The key of the technique is a multimodal fusion algorithm, which synchronizes speech and keypad input and fuses redundant information from two modalities to get the best candidate. A preliminary evaluation shows that users appreciate this technique and it could reduce key presses and enhance the input efficiency.
Randomized k-server on hierarchical binary trees
Authors: Aaron Coté, Adam Meyerson, Laura Poplawski
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We design a randomized online algorithm for k-server on binary trees with hierarchical edge lengths, with expected competitive ratio O(log Delta), where Delta is the diameter of the metric. This is one of the first k-server algorithms with competitive ratio poly-logarithmic in the natural problem parameters, and represents substantial progress on the randomized k-server conjecture. Extending the algorithm to trees of higher degree would give a competitive ratio of O(log2 Delta log n) for the k-server problem on general metrics with n points and diameter Delta.