ppxscal/embedding_network huggingface dataset:
AppLens and launchTile: two designs for one-handed thumb use on small devices
Authors: Amy K. Karlson, Benjamin B. Bederson, John SanGiovanni
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

We present two interfaces to support one-handed thumb use for PDAs and cell phones. Both use Scalable User Interface (ScUI) techniques to support multiple devices with different resolutions and aspect ratios. The designs use variations of zooming interface techniques to provide multiple views of application data: AppLens uses tabular fisheye to access nine applications, while LaunchTile uses pure zoom to access thirty-six applications. We introduce two sets of thumb gestures, each representing different philosophies for one-handed interaction. We conducted two studies to evaluate our designs. In the first study, we explored whether users could learn and execute the AppLens gesture set with minimal training. Participants performed more accurately and efficiently using gestures for directional navigation than using gestures for object interaction. In the second study, we gathered user reactions to each interface, as well as comparative preferences. With minimal exposure to each design, most users favored AppLens's tabular fisheye interface.
TEDDY2: a program package for 2D parabolic composite region problems (abstract)
Authors: S. J. Polak, N. V. Philips
Venue: ACM SIGNUM Newsletter (1975)

Applied physicists usually do not want to solve their problem with a computer, they want to have it solved by a computer.
Cost-effective compilation techniques for Java Just-in-Time compilers
Authors: Kazuyuki Shudo, Satoshi Sekiguchi, Yoichi Muraoka
Venue: Systems and Computers in Japan (2004)

Java Just-in-Time compilers must satisfy a number of requirements in conflict with each other. Effective execution of generated code is not the only requirement: compilation time, memory consumption, and compliance with the Java Virtual Machine specification are also important. We have developed a Java Just-in-Time compiler that requires relatively little implementation labor. Another important objective is developing an adequate base of follow-up research utilizing this compiler. The proposed compilation techniques involve low compilation cost and low development cost. This paper also describes the optimization methods implemented in the compiler, for instance, instruction folding, exception handling with signals, and code patching. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(12): 10&ndash;24, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10564
Path Openings and Closings
Authors: Henk Heijmans, Michael Buckley, Hugues Talbot
Venue: Journal of Mathematical Imaging and Vision (2005)

This paper lays the theoretical foundations to path openings and closings.The traditional morphological filter used for the analysis of linear structures in images is the union of openings (or the intersection of closings) by linear segments. However structures in images are rarely strictly straight, and as a result a more flexible approach is needed.An extension to the idea of using straight line segments as structuring elements is to use constrained paths, i.e. discrete, one-pixel thick successions of pixels oriented in a particular direction, but in general forming curved lines rather than perfectly straight lines. However the number of such paths is prohibitive and the resulting algorithm by simple composition is inefficient.In this paper we propose a way to compute openings and closings over large numbers of constrained, oriented paths in an efficient manner, suitable for building filters with applications to the analysis of oriented features, such as for example texture.
Geometric modeling and representation based on sweep mathematical morphology
Authors: Frank Y. Shih, Vijayalakshmi Gaddipati
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

We propose a framework for geometric modeling and representation by sweep mathematical morphology, which is based on set-theoretic concept together with geometric sweep. We use a new class of morphological operations that allows one to select varying shapes and orientations of structuring elements during the sweeping process. The sweep dilation/erosion provides a natural representation of sweep motion in manufacturing processes, and the sweep opening/closing provides variant degrees of smoothing in image filtering and edge linking. A set of grammatical rules that govern the generation of objects belonging to the same group can be defined. Earley's parser serves in the screening process to determine whether a pattern is a part of the language. Sweep mathematical morphology is demonstrated as an intuitive and efficient tool for geometric modeling and representation.
Model Checking Embedded Systems with PROMELA
Authors: Oscar R. Ribeiro, Joao M. Fernandes, Luis F. Pinto
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

The design process for embedded systems can benefit from the usage of formal methods, if some properties of the systems are checked, before design and implementation decisions are accomplished. This paper presents a model checking approach using the Spin tool, to verify some important properties of embedded systems, namely liveness, deadlock-freedom, and structural conflicts among transitions. The systems are modelled with a variant of Petri Nets, called SIPN (Synchronous and Interpreted Petri Nets), and this paper discusses how SIPN models should be specified with the PROMELA language (input format for the Spin model checker). The approach is exemplified with a case study.
Windows Xp Hacks
Authors: Preston Gralla
Venue:  (2005)

Completely revised and updated, this smart collection of insider tips and tricks covers the XP operating system from start to finish, including all the new features that come with Service Pack 2 (SP2). You'll also find timesaving hacks for security, file distribution, digital media, web browsing, and more. An ideal all-in-one resource for XP beginners, as well as more experienced power users.
Chaos communication synchronization: Combatting noise by distribution transformation
Authors: Rechel M. Hilliam, Anthony J. Lawrance
Venue: Statistics and Computing (2005)

Research in electronic communications has developed chaos-based modelling to enable messages to be carried by chaotic broad-band spreading sequences. When such systems are used it is necessary to simultaneously know the spreading sequence at both the transmitting and receiving stations. This is possible using the idea of synchronization with bivariate maps, providing there is no noise present in the system. When noise is present in the transmission channel, recovery of the spreading sequence may be degraded or impossible. Once noise is added to the spreading sequence, the result may no longer lie within the boundary of the chaotic map. A usual and obvious method of dealing with this problem is to cap iterations lying outside the bounds at their extremes, but the procedure amplifies loss of synchronization. With a minimum of technical details and a computational focus, this paper first develops relevant dynamical and communication theory in the bivariate map context, and then presents a better way of improving synchronization by distribution transformation. The transmission sequence is transformed, using knowledge of the invariant distribution of the spreading sequence, and before noise corrupts the signal in the transmission channel. An `inverse' transformation can then be applied at the receiver station so that the noise has a reduced impact on the recovery of the spreading sequence and hence its synchronization. Statistical simulations illustrating the effectiveness of the approach are presented.
The path-variance problem on tree networks
Authors: Teresa Cáceres, M. Cruz López-de-los-Mozos, Juan A. Mesa
Venue: Discrete Applied Mathematics (2004)

Extensive facility location models on graphs deal with the location of a special type of subgraphs such as paths, trees or cycles and can be considered as extensions of classical point location models. Variance is one of the measures applied in models in which some equality requirement is imposed. In this paper the problem of locating a minimum variance path in a tree network is addressed, and an O(n2 log n) time algorithm is porposed.
Structure and sequence of the human fast skeletal troponin T (TNNT3) gene: insight into the evolution of the gene and the origin of the developmentally regulated isoforms. R. Stefancsik, J.D. Randall, C. Mao and S. Sarkar. Comparative and Functional Genomics 4(6) 2003, 609&ndash;625: Errata
Authors: Staff
Venue: Comparative and Functional Genomics (2004)

The original article to which this Erratum refers was published in Comp. Funct. Genom. 2003: 4: 609&ndash;625. 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
Using a hybrid CA based model for a flexible qualitative qubit simulation: fully frustrated josephson junction ladder (JJL) application
Authors: Claudia R. Calidonna, Adele Naddeo
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Quantum Systems modelling and simulation activity is a challenging research area. Several models and applications were proposed in the past with different approaches. In this paper we propose a flexible qualitative model, according to the Cellular Automata Network Model version 2 (CAN2), a hybrid CA based model, for simulating a qubit. The underlying physical model is a fully frustrated JJL. Once basic system components have been individuated a core model, of the JJL device, is obtained. We show that the core model, according to different tunnelling paths, presents the same components in terms of CAN2 model. For each path different transition functions are defined. The equivalence between two different tunnelling paths shows the flexibility of the adopted scheme
PROXY+: simple proxy augmentation for dynamic content processing
Authors: Chun Yuan, Zhigang Hua, Zheng Zhang
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

Caching dynamic content can bring many benefits to the performance and scalability of Web application servers. However, such mechanisms are usually tightly coupled to individual application servers (or even applications) that prevent caching at more advantageous points. In this paper we propose an approach to enable dynamic content caching at enhanced Web proxies which requires only simple modifications to existing applications.
Secret sharing schemes with three or four minimal qualified subsets
Authors: Jaume Martí-Farré, Carles Padró
Venue: Designs, Codes and Cryptography (2005)

In this paper we study secret sharing schemes whose access structure has three or four minimal qualified subsets. The ideal case is completely characterized and for the non-ideal case we provide bounds on the optimal information rate.
MAKING MARKS SELF-REVEALING
Authors: Gordon Kurtenbach
Venue: ACM SIGCHI Bulletin (1991)

A good interface is easy to use for both a novice and an expert user. For example, menu-driven interfaces are best for novices because they make explicit which commands are available. However expert users know the command set and thus prefer to have "short cuts" for invoking commands. Accelerator keys on keyboards are one example of giving experts short cuts. In pen-driven systems, markings can be used instead of accelerator keys.Usually there is a dramatic difference between novice and expert behavior at the level of physical action. For example, a novice may use a mouse to select from a men u whereas an expert may press an accelerator key. My goal is to reduce the discrepancy between actions without compromising efficiency for the expert and ease of learning for the novice. When the basic action of the novice and expert are the same, novice performance develops the skills necessary for expert performance, smoothing the transition from novice to expert.With this goal in mind, I have designed and implemented an interaction technique in which pie menus provide away of showing users the association between markings and commands they can invoke in pen-based interfaces. By adding a virtual ink trail to the path of the cursor, markings become the natural by-products of the strokes necessary to select a sector from a subdivided circular menu (or "pie").Figure 1 illustrates this technique in the context of creating three simple objects. An expert uses simple shorthand marks to create and place circles, square, or triangles. Object creation and placement is thus fast and efficient. Figure 2 shows how a novice, unsure of what marks to use, can pop-up a pie menu of these objects by keeping the pen pressed. The desired object can then be selected. It is critical to note that selection from the menu constitutes the same physical action as making the corresponding mark for that object. The novice is thus rehearsing the physical action used by an expert.An experiment to evaluate this technique revealed that markings could be used for selecting up to 5 items quickly and accurately. Adding more items is possible whe n metaphors are used to help the user remember mark/menu-item associations For example, the clock-face metaphor was found to be particularly useful. Finally it was found that with very little practice users' performance becam e substantially faster and less error-prone.
A novel state cache scheme in structured P2P systems
Authors: Hailong Cai, Jun Wang, Dong Li, Jitender S. Deogun
Venue: Journal of Parallel and Distributed Computing (2005)

Large-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Current structured overlays do not identify well the rhythm in the dynamic activities, thus resulting in high maintenance overhead. In this paper, we present a new state cache system, called SCS, that solves the problem by exploiting the access patterns of dynamic activities in P2P systems. SCS partitions the whole P2P network into clusters and dynamically chooses a ''super'' node in each cluster to selectively record and maintain the routing information for departed nodes most likely to arrive back in the near future. The cached routing information enables SCS to simplify self-organization, reduce system maintenance overhead and provide high quality routing service. The experimental results show that SCS reduces the maintenance overhead by up to 66% while delivering much better routing performance, as compared to current structured P2P systems.
Experience in integrating Java with C&num; and .NET: Research Articles
Authors: Judith Bishop, R. Nigel Horspool, Basil Worrall
Venue: Concurrency and Computation: Practice Experience (2005)

Java programmers cannot help but be aware of the advent of C&num;, the .NET network environment, and a host of new supporting technologies, such as Web services. Before taking the big step of moving all development to a new environment, programmers will want to know what are the advantages of C&num; as a language over Java, and whether the new and interesting features of C&num; and .NET can be incorporated into existing Java software. This paper surveys the advantages of C&num; and then presents and evaluates experience with connecting it to Java in a variety of ways. The first way provides evidence that Java can be linked to C&num; at the native code level, albeit through C++ wrappers. The second is a means for retaining the useful applet feature of Java in the server-side architecture of Web services written in C&num;. The third is by providing a common XML-based class for the development of graphical user interfaces (GUIs), which can be incorporated into Java or C&num;. An added advantage of this system, called Views, is that it can run independently of the resource-intensive development environment that would otherwise be needed for using C&num;. A major advantage of the methods described in this paper is that in all cases the Java program is not affected by the fact that it is interfacing with C&num;. The paper concludes that there are many common shared technologies that bring Java and C&num; close together, and that innovative ways of using others can open up opportunities not hitherto imagined. Copyright &copy; 2005 John Wiley & Sons, Ltd.
On Efficient Computation of the Optimization Problem Arising in the Inverse Modeling of Non-Stationary Multiphase Multicomponent Flow Through Porous Media
Authors: Subhendu Bikash Hazra, Volker Schulz
Venue: Computational Optimization and Applications (2005)

In this paper we discuss a method of solving inverse problems in non-isothermal multiphase multicomponent flow through porous media. The conceptual model is described by a system of non-linear partial differential equations which involve unknown parameters. These parameters are to be determined using a set of observations at discrete points in space and time by an optimization method. It is based on a reduced Gauss-Newton iteration in combination with an efficient gradient computation which takes advantage of a recently developed efficient numerical simulation technique. A sensitivity analysis is carried out for the optimum parameter set. Numerical experiments are performed for a one dimensional column experiment carried out at the VEGAS, University of Stuttgart, Germany.
A Study of Aggregated 2D Gabor Features on Appearance-Based Face Recognition
Authors: King-Hong Cheung, Jane You, Wai-Kin Kong, David Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Existing approaches to holistic appearance based face recognition require a high dimensional feature space to attain fruitful performance. We have proposed a relatively low feature dimensional scheme to deal with the face recognition problem. We use the aggregated responses of 2D Gabor filters to represent face images. We have investigated the effect of "duplicate" images and the effect of facial expressions. Our results show that the proposed method is more robust than the PCA-based method under varying facial expressions, especially in recognizing "duplicate" images.
SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion
Authors: Guohua Jin, John Mellor-Crummey
Venue: ACM Transactions on Mathematical Software (TOMS) (2005)

Because they are continuous and self-similar, space-filling curves have been widely used in mathematics to transform multi-dimensional problems into one-dimensional forms. For scientific applications, reordering computation by certain space-filling curves can significantly improve data reuse because of the locality properties of these curves. However, when space-filling curves are used in programs for reordering data, traversal or indexing of the curves must be efficient. To address this problem, we present the table-driven framework SFCGen to efficiently generate multi-dimensional space-filling curves on the fly. The framework is general and easy enough to be used in any application that can be partitioned recursively in multiple dimensions. We describe a movement specification table, a universal turtle algorithm to enumerate points along a space-filling curve, a table-based indexing algorithm to transform coordinates of a point into its position along the curve and an algorithm to pregenerate the table automatically. As examples, we show how high-dimensional Hilbert, Morton, and Peano curves and a two-dimensional Sierpi&nacute;ski curve can be generated with our algorithms. We present performance results for Hilbert, Morton, and Peano curves and compare the efficiency of our curve generation algorithm with the most recent work on generating Hilbert curves. Our experimental results on three modern microprocessor-based platforms show that SFCGen performs up to 63&percent; faster than the most recent recursive algorithm on 2D curve generation and up to a factor of 132 faster than two previous byte-oriented non-recursive implementations. On curve indexing, SFCGen performs as much as a factor of three faster than the byte-oriented implementation. Our results on 4D space-filling curves also show that SFCGen scales very well with curve level for higher dimensional spaces.
McDonnell Douglas Electronic Systems Company: MUC-3 test results and analysis
Authors: David de Hilster, Amnon Meyers
Venue: Proceedings of the 3rd conference on Message understanding (1991)

INLET scored 25% recall and 35% precision after interactive correction. Non-interactive scores were 22% and 32%, respectively. Relative to other sites, we ranked 7th in recall and 9th in precision.
A Computational Framework for Real-time Detection and Recognition of Large Number of Classes
Authors: Xiuwen Liu
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Inspired by recent advances in real-time vision for certain applications, we propose a framework for developing and implementing systems that are capable of detecting and recognizing a large number of objects in real time on a top desktop workstation with field programmable gate array (FPGA) devices. To avoid explicit segmentation, detection and recognition is performed by scanning through local windows of input scenes at multiple scales. This is achieved by using a new feature family (named as topological local spectral histogram (ToLoSH) features, consisting of histograms of local regions of filtered images) and a lookup table decision tree (i.e. a decision tree where each node is implemented as lookup tables) as the classifier to reduce the average time per local window while achieving high accuracy. We show through analysis and empirical studies that ToLoSH features are effective to discriminate a large number of object classes and can be computed using only three instructions. Given the choice of the ToLoSH feature family and lookup table decision tree classifiers, the problem of real-time scene interpretation becomes a joint optimization problem of learning an optimal classifier and associated optimal ToLoSH features. To show the feasibility of the proposed framework, we have constructed a decision lookup table tree for a dataset consisting of textures, faces, and objects. We argue that the proposed framework may reconcile some of the fundamental issues in visual recognition modeling. 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
Plasma process induced damages on n-MOSFET with plasma oxidized and nitrided gate dielectrics
Authors: T. S. Jang, M. H. Ha, K. D. Yoo, B. K. Kang
Venue: Microelectronic Engineering (2004)

The material and electrical properties of a 30 A-thick gate oxide, which is fabricated using plasma oxidation and subsequently nitrided in N"2 plasma, are investigated. Before plasma nitridation, the chemical bonding states and gate oxide integrity characteristics of the plasma oxidized (PO) gate are nearly the same as these of the wet oxidized (WO) gate. The plasma nitridation reduces the bandgap of the gate dielectric and increases the gate leakage current. The gate dielectric with a reduced bandgap provides a discharge path for the charging current from processing plasma and decreases the plasma process-induced damage. The immunity of the gate dielectric to hot carrier effects is improved with plasma nitridation even at a very high antenna ratio. Although both the PO and WO gates show a similar immunity to hot carrier stress after plasma nitridation, the immunity to a constant voltage stress is better on the plasma nitrided WO gate.