ppxscal/embedding_network huggingface dataset:
Function-based Time-dependent Shape Modeling on the Web
Authors: Qi Liu, Alexei Sourin
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

In this paper we propose FVRML-a function-based extension of Virtual Reality Modeling Language which allows for time-dependent shape modeling on the web. Shape's geometry, 3D texture, color and transformations can be defined with analytical functions typed straight in VRML code. These analytical functions can be functions of time. FVRML allows us to greatly extend the abilities of VRML with a very intuitive approach to shape modeling based on using analytical functions. Several functions can be combined into one using Java scripts emulated in FVRML, which allows for even greater flexibility and convenience of shape modeling.
A Distributed Protocol for Dynamic Address Assignment in Mobile Ad Hoc Networks
Authors: Mansi Ramakrishnan Thoppian Ravi Prakash
Venue: IEEE Transactions on Mobile Computing (2006)

A Mobile Ad hoc NETwork (MANET) is a group of mobile nodes that form a multihop wireless network. The topology of the network can change randomly due to unpredictable mobility of nodes and propagation characteristics. Previously, it was assumed that the nodes in the network were assigned IP addresses a priori. This may not be feasible as nodes can enter and leave the network dynamically. A dynamic IP address assignment protocol like DHCP requires centralized servers that may not be present in MANETs. Hence, we propose a distributed protocol for dynamic IP address assignment to nodes in MANETs. The proposed solution guarantees unique IP address assignment under a variety of network conditions including message losses, network partitioning and merging. Simulation results show that the protocol incurs low latency and communication overhead for an IP address assignment.
Simulation as a tuning tool in TSO
Authors: John Chapman
Venue: ACM SIGSIM Simulation Digest (1974)

The production TSO system at Standard Oil has been running since August 1973. Prior to this date, several limited test systems with small user groups were run, to collect information on modifications necessary to support interactive programming in a manner which would conform to current application development needs and practices. To support program development under O.S. Time Sharing Option, it was necessary to modify IBM supplied code, as well as add code, to the system. The experiments which led to the definition of the modifications needed included a six-month long test system to support a single, small group of application programmers. At the conclusion of this test, the programming group involved estimated an increase in productivity (groupwide) of twenty to thirty-five percent.
The Wavelet Transformation for Temporal Gene Expression Analysis
Authors: JZ. Song, KM. Duan, M. Surette
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

A variety of high throughput methods have made it possible to generate detailed temporal expression data for a single gene or large numbers of genes. Methods for analysis of these large data sets can be problematic. One challenge is the comparison of temporal expression data obtained from different growth conditions where the patterns of expression may be shifted in time. We propose the use of wavelet analysis to transform the data obtained under different growth conditions to permit comparison of expression patterns from experiments that have time shifts or delays. We demonstrate this approach using detailed temporal data for a single bacterial gene obtained under 72 different growth conditions. This general strategy for can be applied in the analysis of data sets of thousands of genes during cellular differentiation and response.
Languages evolve too! Changing the Software Time Scale
Authors: Jean-Marie Favre
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

Humans will have to live with software for a long time. As demonstrated by the Y2K problem, computer professionals used a wrong time scale when thinking about software. Large software products live much longer than expected. It took a few decades to the research community to admit that software engineering was not only about software development, but above all, about software evolution. However, most academics still consider languages as immutable artefacts. Language/software coevolution issues are still neglected. Migration issues are however commonplace in software industry... It is therefore time to recognize that languages evolve too. Languages are integral parts of software products. Languages are software too. This paper surveys a few models of evolution taking decades and centuries as time-scales. Then programming languages evolution over the last half-century is sketched by means of a metamodel movie.
Make stunning schenker graphs with GNU Lilypond
Authors: Kris Shaffer
Venue: Linux Journal (2005)

Think that Linux-based graphics programs can't compete? GNU Lilypond generates beautiful graphics that make commercial alternatives seem second-rate.
Patterned silicon-on-insulator technology for RF Power LDMOSFET
Authors: Xinhong Cheng, Zhaorui Song, Yemin Dong, Yuehui Yu, DaShen Shen
Venue: Microelectronic Engineering (2005)

This paper presents the first results of a practical SOI LDMOSFET in patterned SOI substrate that has been successfully prepared by masked SIMOX method. The device exhibits good electrical performance including a leakage current of 20nA, the flat output characteristic curves, a cutoff frequency up to 8GHz, and a voltage gain of 2.5dB at 2GHz. The proposed technology not only suppresses floating body effects effectively but also preserves SOI technology's advantage of low power assumption. Moreover, the process is compatible with conventional SOI technology.
Evolutionary test data generation: a comparison of fitness functions: Research Articles
Authors: Alison Watkins, Ellen M. Hufnagel
Venue: Software&mdash;Practice Experience (2006)

Previous research using genetic algorithms to automate the generation of data for path testing has utilized several different fitness functions, assessing their usefulness by comparing them to random generation. This paper describes two sets of experiments that assess the performance of several fitness functions, relative to one another and to random generation. The results demonstrate that some fitness functions provide better results than others, generating fewer test cases to exercise a given program path. In these studies, the branch predicate and inverse path probability approaches were the best performers, suggesting that a two-step process combining these two methods may be the most efficient and effective approach to path testing. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Affect-based indexing and retrieval of films
Authors: Ching Hau Chan, Gareth J. F. Jones
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Digital multimedia systems are creating many new opportunities for rapid access to content archives. In order to explore these collections using search applications, the content must be annotated with significant features. An important and often overlooked aspect of human interpretation of multimedia data is the affective dimension. Affective labels of content can be extracted automatically from within multimedia data streams. These can then be used for content-based retrieval and browsing. In this study affective features extracted from multimedia audio content are mapped onto a set of keywords with predetermined emotional interpretations. These labels are then used to demonstrate affect-based retrieval on a range of feature films.
A 16-classification partition of formula set F(S) in revised Kleene system $$\bar W$$
Authors: Cheng Han, Guojun Wang, Wenyan Xu
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

This paper presents an exact expression of V(A) which is an unique formula A of formula set F(S) in revised Kleene system $$\bar W$$. It also obtains a 16-classification congruence partition about unary operation &#x00ac;, combing with generalized tautology theory, and discusses each one&#x2019;s closeness about MP and HS operations.
Effective and Efficient Distributed Model-Based Clustering
Authors: Hans-Peter Kriegel, Peer Kroger, Alexey Pryakhin, Matthias Schubert
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In many companies data is distributed among several sites, i.e. each site generates its own data and manages its own data repository. Analyzing and mining these distributed sources requires distributed data mining techniques to find global patterns representing the complete information. The transmission of the entire local data set is often unacceptable because of performance considerations, privacy and security aspects, and bandwidth constraints. Traditional data mining algorithms, demanding access to complete data, are not appropriate for distributed applications. Thus, there is a need for distributed data mining algorithms in order to analyze and discover new knowledge in distributed environments. One of the most important data mining tasks is clustering which aims at detecting groups of similar data objects. In this paper, we propose a distributed model-based clustering algorithm that uses EM for detecting local models in terms of mixtures of Gaussian distributions. We propose an efficient and effective algorithm for deriving and merging these local Gaussian distributions to generate a meaningful global model. In a broad experimental evaluation we show that our framework is scalable in a highly distributed environment.
Extending Software Communications Architecture for QoS Support in SDR Signal Processing
Authors: Jaesoo Lee, Jiyong Park, Seunghyun Han, Seongsoo Hong
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

The Sofiare Communications Architecture (SCA) is middleware for providing component interfaces and dynamic reconfigurability to sofiare define radio (SDR) modems and it is widely adopted by the SDR forum. Although its main application domains include real-time signal processing, SCA lacks QoS support. We thus propose a QoS-enabled extension of SCA called Q-SCA. Our extended architecture incorporates a new waveform model, extended domain profiles that describe QoS requirements, and a modiJied application instantiation process that supports both admission control and resource allocation. We show the viability of Q-SCA through full implementation and experiments.
Security for Energy Constrained RFID System
Authors: V. Natarajan, A. Balasubramanian, S. Mishra, R. Sridhar
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

The information exchange between RFID tags and the reader is not secure due to much inherent vulnerabilities of RF links. Moreover, these tags are typically energy constrained thus limiting the implementation of complex security algorithms. Energy depleted RFID tags are source of potential attacks from intruders with malicious intent. In this paper, we present a solution that helps securing both RFID tags and the information exchange. To this end, we have developed a communication strategy where a tag periodically communicates its security status to the reader and is authenticated. The information exchange between the tags and the reader is secured using AES encryption. Also, we use PUF circuit and a power sensing circuit to identify malicious readers and tags. In addition, we introduce a concept of semi-active tags, whereby an RFID tag whose energy is depleted can use neighboring tags to communicate its security status and be authenticated by the reader. Analysis shows the benefits of our approach.
Scanning Scene Tunnel for City Traversing
Authors: Jiang Yu Zheng
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

This paper proposes a visual representation named scene tunnel for capturing urban scenes along routes and visualizing them on the Internet. We scan scenes with multiple cameras or a fish-eye camera on a moving vehicle, which generates a real scene archive along streets that is more complete than previously proposed route panoramas. Using a translating spherical eye, properly set planes of scanning, and unique parallel-central projection, we explore the image acquisition of the scene tunnel from camera selection and alignment, slit calculation, scene scanning, to image integration. The scene tunnels cover high buildings, ground, and various viewing directions and have uniformed resolutions along the street. The sequentially organized scene tunnel benefits texture mapping onto the urban models. We analyze the shape characteristics in the scene tunnels for designing visualization algorithms. After combining this with a global panorama and forward image caps, the capped scene tunnels can provide continuous views directly for virtual or real navigation in a city. We render scene tunnel dynamically by view warping, fast transmission, and flexible interaction. The compact and continuous scene tunnel facilitates model construction, data streaming, and seamless route traversing on the Internet and mobile devices.
Order from Chaos
Authors: Natalya Noy
Venue: Queue (2005)

There is probably little argument that the past decade has brought the “big bang” in the amount of online information available for processing by humans and machines. Two of the trends that it spurred (among many others) are: first, there has been a move to more flexible and fluid (semi-structured) models than the traditional centralized relational databases that stored most of the electronic data before; second, today there is simply too much information available to be processed by humans, and we really need help from machines. On today’s Web, however, most of the information is still for human consumption in one way or another.
MemBIST Applet for Learning Principles of Memory Testing and Generating Memory BIST
Authors: Maria Fischerova, Martin Simlastik
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

The paper presents a software tool that demonstrates principles of RAM memory testing and of the memory BIST structure. The MemBIST software tool automatically generates built-in self-test blocks for a given memory matrix as a VHDL model of the whole system. As a complement to the BIST structure generator, a module for visualisation of selected RAM memory fault models, March C- test algorithm as well as a memory self-testing architecture principle is a part of the tool. The developed system was implemented as a Java applet what means its good compatibility regarding different hardware and operating system platforms, its safety and accessibility while it is placed on Internet. The presented MemBIST applet is useful as an educational tool and a training tool in built-in selftesting for RAM memories.
Touching glass: edification and mediated potential
Authors: Philippe Richard Perron
Venue:  (2005)

This dissertation is an examination of how metatheoretical approaches to understanding can assist in our interpretation and design of computer mediated communication (CMC) environments for place making. CMC is considered in terms of its potential to support place making dialogue. Specifically, the dialogic theories of Friere, Habermas and Rorty are outlined and considered as a means for the interpretation of CMC settings. The three theoretical positions are discussed in terms of their ontological, epistemological and methodological differences. These differences are then considered in terms of how they may be used for interpreting and building alternative CMC settings regarding place-making activities. Ten CMC projects were developed as ways of uncovering local meaning about place and engaging in place making activities. The projects are used to illustrate how theories of knowledge, that are highly dialogic in nature, may influence the ways that we think about computer mediated communication. The projects range from highly didactic (information rich) to very open ended (more dialogic) on-line settings. In the interpretations of the projects, sustainable community design is considered as a dialogic form of place making, rather than as a prescriptive method or model for modifying the physical environment. From reflecting on these CMC projects in the context of dialogic thinking, I make the argument that there needs to be shift away from using the Internet as a strategic vehicle for spatial inquiry towards creating on-line environments for people to share both their personal visions and understandings about the nature of place. Rorty's concepts of abnormal language and edification influence an approach that transforms the conventional notion of the Internet as a repository of (spatial) information and tools into an evolving matrix of intersecting interpretations and desires. In building a geography of edification, presented as a mobile system of dialogue and interpretation, I draw on the abnormal language of Deleuze and Guattari to liberate CMC from its stratified past and permit CMC-based rhizomatic discourses to emerge.
Reviews
Authors: Raul Rojas
Venue: IEEE Annals of the History of Computing (2005)

The Reviews department features full reviews of Frank Soltis' Fortress Rochester: The Inside Story of the IBM iSeries and Richard Coopey's Information Technology Policy: An International History. The "Briefly Noted" sidebar contains short summaries of Hunter Crowther-Heyck's Herbert A. Simon: The Bounds of Reason in Modern America, Eric Sweden and David Ferro's Computers: The Life Story of a Technology, Galileo Galilei's Le Operazione del Compasso Geometrico et Miltare [Operation of the Geometric and Military Compass], and Elaine Whelan's My Mom's Making History: The Story of Computer Software, Copyrights, and Creativity.
A Dynamic Compilation Framework for Controlling Microprocessor Energy and Performance
Authors: Qiang Wu, Margaret Martonosi, Douglas W. Clark, V. J. Reddi, Dan Connors, Youfeng Wu, Jin Lee, David Brooks
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

Dynamic voltage and frequency scaling (DVFS) is an effective technique for controlling microprocessor energy and performance. Existing DVFS techniques are primarily based on hardware, OS timeinterrupts, or static-compiler techniques. However, substantially greater gains can be realized when control opportunities are also explored in a dynamic compilation environment. There are several advantages to deploying DVFS and managing energy/performance tradeoffs through the use of a dynamic compiler. Most importantly, dynamic compiler driven DVFS is fine-grained, code-aware, and adaptive to the current microarchitecture environment. This paper presents a design framework of the run-time DVFS optimizer in a general dynamic compilation system. A prototype of the DVFS optimizer is implemented and integrated into an industrialstrength dynamic compilation system. The obtained optimization system is deployed in a real hardware platform that directly measures CPU voltage and current for accurate power and energy readings. Experimental results, based on physical measurements for over 40 SPEC or Olden benchmarks, show that significant energy savings are achieved with little performance degradation. SPEC2K FP benchmarks benefit with energy savings of up to 70% (with 0.5% performance loss). In addition, SPEC2K INT show up to 44% energy savings (with 5% performance loss), SPEC95 FP save up to 64% (with 4.9% performance loss), and Olden save up to 61% (with 4.5% performance loss). On average, the technique leads to an energy delay product (EDP) improvement that is 3X-5X better than static voltage scaling, and is more than 2X (22% vs. 9%) better than the reported DVFS results of prior static compiler work. While the proposed technique is an effective method for microprocessor voltage and frequency control, the design framework and methodology described in this paper have broader potential to address other energy and power issues such as di/dt and thermal control.
Consistency for Partially Defined Constraints
Authors: Arnaud Lallouet, Andrei Legtchenko
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Partially defined Constraints can be used to model the incomplete knowledge of a concept or a relation. Instead of only computing with the known part of the constraint, we propose to complete its definition by using Machine Learning techniques. Since constraints are actively used during solving for pruning domains, building a classifier for instances is not enough: we need a solver able to reduce variable domains. Our technique is composed of two steps: first we learn a classifier for the constraint's projections and then we transform the classifier into a propagator. We show that our technique not only has good learning performances but also yields a very efficient solver for the learned constraint.
A Real-Time Image Selection Algorithm: Fingerprint Recognition Using Mobile Devices with Embedded Camera
Authors: Dongjae Lee, Wonchurl Jang, Doeksoo Park, Sung-Jae Kim, Jaihie Kim
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

This paper proposes a real-time image selection algorithm for fingerprint recognition system, which uses the embedded camera of the mobile device. In general, auto-focusing algorithms of the camera system use the gradient measures to estimate high-frequency components of an image. In mobile device, images are greatly affected by environmental light sources. Therefore, obtained image might not qualify for the fingerprint recognition system, even when the image is focused. Consequently, image should be investigated whether it is usable or not. Variance-Modified-Laplacianof Gaussian (VMLOG) and Image quality index (QI) proposed in this paper solve such problem. VMLOG considers high-frequency component and repeatable patterns of ridges. Experimental results shows that the processing time of the proposed algorithm is enough fast to be adapted in real time system as like mobile device and the proposed algorithm selects exactly a recognizable image.
Characterizing user-perceived impairment events using end-to-end measurements: Research Articles
Authors: Soshant Bali, Yasong Jin, Victor S. Frost, Tyrone Duncan
Venue: International Journal of Communication Systems (2005)

Measures of quality of service (QoS) must correlate to end-user experience. For multimedia services, these metrics should focus on the phenomena that are observable by the end-user. Metrics such as delay and loss may have little direct meaning to the end-user because knowledge of specific coding and&#x002F;or adaptive techniques is required to translate delay and loss to the user-perceived performance. Impairment events, as defined in this paper, are observable by the end-users independent of coding, adaptive playout or packet loss concealment techniques employed by their multimedia applications. Time between impairments and duration of impairments are metrics that are easily understandable by a network user. Methods to detect these impairment events using end-to-end measurements are developed here. In addition, techniques to identify Layer 2 route changes and congestion events using end-to-end measurements are also developed. These are useful in determining what caused the impairments. End-to-end measurements were conducted for about 26 days on 9 different node pairs to evaluate the developed techniques. Impairments occurred at a high rate on the two paths on which congestion events were detected. On these two paths, congestion occurred for 6&ndash;8 hours during the day on weekdays. Impairments caused by route changes were rare but lasted for several minutes. Copyright &copy; 2005 John Wiley & Sons, Ltd.