ppxscal/embedding_network huggingface dataset:
Fabrication of microfluidic channel utilizing silicone rubber with vacuum casting
Authors: S. C. H. Thian, J. Y. H. Fuh, Y. S. Wong, H. T. Loh, P. W. Gian, Y. Tang
Venue: Microsystem Technologies (2008)

Microfluidic patterns of 100&#x00a0;&#x03bc;m in width and 50&#x00a0;&#x03bc;m height were replicated from a master using vacuum casting with silicone rubber. These silicone copies are subjected to thorough analysis for dimensional accuracy against the master pattern. Analysis of experimental results shows repeatability of the silicone rubber molds. To test the limits of vacuum casting with silicone rubber, an attempt was undertaken to replicate 8&#x00a0;&#x03bc;m microchannel and submicron features. The results show that casting of microfluidic channel via vacuum casting has high repeatability.
User acceptance of context-aware services: self-efficacy, user innovativeness and perceived sensitivity on contextual pressure
Authors: O. Kwon, K. Choi, M. Kim
Venue: Behaviour & Information Technology (2007)

The aim of this paper is to empirically examine how individual characteristics affect user acceptance of context-aware services such as GPS-based telematics systems and location-based commerce, which together have become highly promising fields for mobile or ubiquitous e-commerce. To examine these individual characteristics, we applied a technology acceptance model to construct an amended model that focuses on three individual differences: self-efficacy, personal innovativeness and perceived sensitivity on contextual pressure. As a result, we discovered that the perceived sensitivity on contextual pressure, which is newly adopted as a construct in this paper, affects behavioural intention in using context-aware services.
Design Guidance Using Simulation-Based Bayesian Belief Networks
Authors: Artem Parakhine, John Leaney, Tim O'Neill
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

In our work, the task of complex computer-based system design optimization involves exploration of a number of possible candidate designs matching the optimisation criteria. However, the process by which the possible candidate designs are generated and rated is fundamental to an optimal outcome. It is dependent upon the set of system characteristics deemed relevant by the designer given the systems requirements. We propose a method which is aimed at providing the designer with guidance based upon description of the possible causal relationships between various system characteristics and qualities. This guidance information is obtained by employing principles of multiparadigm simulation to generate a set of data which is then processed by an algorithm to generate a Bayesian Belief Network representation of causalities present in the source system. Furthermore, we address the issues and tools associated with application of the proposed method by presenting a detailed simulation and network generation effort undertaken as part of a significant industrial case study.
Semantic concept extraction from sports video for highlight generation
Authors: M. H. Kolekar, S. Sengupta
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

A multi-layered, hierarchical framework for generic sports event analysis has been proposed in this paper. Each layer uses different features such as short-time audio energy, short-time Zero Crossing Rate, color histogram, fractal dimension, motion, etc and classifiers such as Hidden Markov Model, threshold-based classifier, etc. We demonstrate our approach on sports video. The automated semantic concept extraction is ideally required for application such as highlight generation, indexing and retrieval.
CAVENET: Description and analysis of a toolbox for vehicular networks simulation
Authors: G. De Marco, M. Tadauchi, L. Barolli
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

Simulation of Vehicular Ad hoc Networks is an important aspect of the analysis and design of intelligent routing and broadcasting protocols. In this regard, we propose a lightweight simulator, which separates the mobility model of the vehicles from the details of communication protocols. The mobility model is written in a high-level computing language, and the movement trace of nodes can be exported in a format compatible with standard network simulators. As a proof of concept, by means of extensive simulations, we review the properties of the generated mobility trace by measuring some parameters of interest, such as the average velocity. We show that, in general, the average velocity is a long-range dependent variable, and this fact poses some doubts on how to set the length of the simulation. Accordingly, we discuss the problem of transient data and stationarity, which is well understood only in the deterministic case.
Automated Metadata Generation and its Application to Biological Association Extraction
Authors: Snehasis Mukhopadhyay, Niranjan Jayadevaprakash
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Text mining methods are used in this paper to extract associations among biological objects. Transitive association methods using metadata (MeSH terms) have the potential to discover implicit associations without relying on explicit co-occurrence of objects of interest. To avoid costly manual metadata assignment and deal with missing metadata, automated metadata generation methods are described in the paper. The association knowledge extracted using automatically generated metadata is found to be as good as that that using manually assigned metadata, in terms of precision.
Combining self-healing and proofreading in self-assembly
Authors: David Soloveichik, Matthew Cook, Erik Winfree
Venue: Natural Computing: an international journal (2008)

Molecular self-assembly is a promising approach to bottom-up fabrication of complex structures. A major impediment to the practical use of self-assembly to create complex structures is the high rate of error under existing experimental conditions. Recent theoretical work on algorithmic self-assembly has shown that under a realistic model of tile addition and detachment, error correcting tile sets are possible that can recover from the attachment of incorrect tiles during the assembly process. An orthogonal type of error correction was recently considered as well: whether damage to a completed structure can be repaired. It was shown that such self-healing tile sets are possible. However, these tile sets are not robust to the incorporation of incorrect tiles. It remained an open question whether it is possible to create tile sets that can simultaneously resist wholesale removal of tiles and the incorporation of incorrect ones. Here we present a method for converting a tile set producing a pattern on the quarter plane into a tile set that makes the same pattern (at a larger scale) but is able to withstand both of these types of errors.
A penalty function method for solving inverse optimal value problem
Authors: Yibing Lv, Tiesong Hu, Zhongping Wan
Venue: Journal of Computational and Applied Mathematics (2008)

In order to consider the inverse optimal value problem under more general conditions, we transform the inverse optimal value problem into a corresponding nonlinear bilevel programming problem equivalently. Using the Kuhn-Tucker optimality condition of the lower level problem, we transform the nonlinear bilevel programming into a normal nonlinear programming. The complementary and slackness condition of the lower level problem is appended to the upper level objective with a penalty. Then we give via an exact penalty method an existence theorem of solutions and propose an algorithm for the inverse optimal value problem, also analysis the convergence of the proposed algorithm. The numerical result shows that the algorithm can solve a wider class of inverse optimal value problem.
Efficient simulations of small shared memories on bounded degree networks
Authors: K. T. Herley
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The problem of simulating a parallel random-access machine (PRAM) with n processors and memory size m>or=n on an n-node bounded degree network (BDN) is considered. Since many of the more efficient PRAM algorithms use an amount of shared memory not much larger than the number of processors, the case in which m=o(n/sup 1+ epsilon /) is considered, and a deterministic solution to the simulation problem is presented. For m=n(log n)/sup /O/sup (1)/ the running time of O(log n log log n) is within a factor of O(log log n) of the lower bound imposed by the diameter of the network.
Reducing resolution loss in two-pass rendering by optimal view directions and display-surface partitioning
Authors: R. Matt Steele, Christopher Jaynes, Ruigang Yang
Venue: Proceedings of the 5th ACM/IEEE International Workshop on Projector camera systems (2008)

We describe a method for reducing the amount of aliasing or resolution loss in two-pass rendering for distortion and alignment correction of a projector-based display. Resolution loss is caused by the fact that the second rendering pass must resample the result of the first rendering pass, and the two procedures in general have sampling rates that vary differently. We show that for a flat display surface, it is possible to choose a viewing direction for the first-pass render so that its sampling-rate variations cancel with variations of the second-pass sampling rate. This means that the first-pass effectively samples the projector frame-buffer evenly, so an appropriate resolution for the first-pass render will provide uniformly low aliasing over the entire framebuffer. We also show that, for flat display surfaces, this choice of view direction can be combined with an appropriate first-pass intrinsics matrix to eliminate the need for a second pass. The resulting single-pass rendering algorithm is very similar to existing single-pass techniques, but has a few advantages that we discuss. For a non-flat display surface, relative sampling cannot be made perfectly uniform, but the optimal view direction for a best-fit plane provides an approximate solution when the display surface is almost flat. Although the approximation is poor when the display surface differs radically from a plane, we describe a technique for those cases, which automatically subdivides the display surface into partitions that are approximately planar. In common display-surface configurations, great improvements in rendering quality are obtained by using two or three partitions, which causes only modest rendering overhead.
Manual Specific Testing and Quality Evaluation for Embedded Software
Authors: Seon-Jae Jang, Hae-Geun Kim, Youn-ky Chung
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Higher performance for embedded software with the intent of decreasing cost of hardware made widespread and development of hardware. Higher performance makes embedded software more complex, but to satisfy user demands and that of time-to-market, it has to be developed fast and achieve quality. Testing is the most important factor in embedded software development. Increasing complexity of the embedded system makes difficult to test manually and properly evaluate quality. This made automated testing becoming popular and in turn decline of manual testing. Because of the characteristics of embedded software, automated testing has difficulty performing all relevant tests and evaluation of the areas of concern. Manual testing of embedded software is affective in these areas and can directly affect quality of software. To properly test software manually it is necessary to have the proper testing procedures and personnel along with a well defined description of the system. In this paper we propose a manual testing mechanism that is more structured, effective and will improve quality of embedded software. We describe the model which is based on the existing problem of manual testing and analysis requirements. The model and technique we propose will make testing on software and related hardware areas more effective, and the way to share the testing experience and using quality evaluation.
Multiprocessors and the Real-Time Specification for Java
Authors: Andy Wellings
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Currently, the Real-Time Specification for Java (RTSJ) is silent on multiprocessor issues It attempts not to preclude multiprocessor implementations but provides no direct support. This paper discusses the issues that need to be addressed if the RTSJ is to be better defined for execution on a multiprocessor system. It proposes new dispatching and allocation models. Issues of cost enforcement, interrupts affinity and processor failure are covered.
Design and Performance Study for a Mobility Management Mechanism (WMM) Using Location Cache for Wireless Mesh Networks
Authors: Di-Wei Huang, Phone Lin, Chai-Hien Gan
Venue: IEEE Transactions on Mobile Computing (2008)

Wireless Mesh Networks (WMNs) have emerged as one of the major technologies for the 4G high-speed mobile networks. In a WMN, a mesh backhaul connects the WMN with Internet, and mesh access points (MAPs) provide wireless network access service to mobile stations (MSs). The MAPs are stationary and connected through the wireless mesh links. Due to MS mobility in WMNs, Mobility Management (MM) is required to efficiently and correctly route the packets to MSs. We propose an MM mechanism named Wireless mesh Mobility Management (WMM). The WMM adopts the location cache approach where mesh backhaul and MAPs (referred to as mesh nodes; MNs) cache the MS's location information while routing the data for the MS. The MM is exercised when MNs route the packets. We implement the WMM and conduct an analytical model and simulation experiments to investigate the performance of WMM. We compare the signaling and routing cost between WMM and other existing MM protocols. Our study shows that WMM has light signaling overhead and low implementation cost.
AC analysis of operational rectifiers via conventional circuit simulators
Authors: Dalibor Biolek, Viera Biolková, Zdenek Kolka
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

A novel method for AC analysis of nonlinear circuits such as operational rectifiers is described. The resulting generalized frequency responses exhibit a dependence of the quality of rectification on the frequency and magnitude of input signal. A concrete procedure of the analysis of these characteristic via SPICE-family circuit simulators is described.
A generalization of Tur&aacute;n's theorem
Authors: Benny Sudakov, Tibor Szabó, H. Van Vu
Venue: Journal of Graph Theory (2005)

In this paper, we obtain an asymptotic generalization of Tur&aacute;n's theorem. We prove that if all the non-trivial eigenvalues of a d-regular graph G on n vertices are sufficiently small, then the largest Kt-free subgraph of G contains approximately (t&thinsp;-&thinsp;2)-(t&thinsp;-&thinsp;1)-fraction of its edges. Tur&aacute;n's theorem corresponds to the case d&thinsp;=&thinsp;n&thinsp;-&thinsp;1. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
Local defect correction in numerical simulation of surface remelting
Authors: Martijn Anthonissen
Venue: International Journal of Computer Mathematics (2007)

We study the efficient numerical simulation of laser surface remelting, a process to improve the surface quality of steel components. To this end we use adaptive grids, which are well-suited for problems with moving heat sources. To account for the local high activity due to the heat source, we introduce local uniform grids and couple the solutions on the global coarse and local fine grids using local defect correction (LDC). LDC is based on simple data structures and simple discretization stencils on uniform or tensor-product grids.
Using persistent homology to recover spatial information from encounter traces
Authors: Brenton Walker
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiments which collect encounter data. Most analyses of these data have focused on isolated statistical properties such as the distribution of node inter-encounter times and the degree distribution of the connectivity graph. On the other hand, new developments in computational topology, in particular persistent homology, have made it possible to compute topological invariants from noisy data. These homological methods provide a natural way to draw conclusions about global structure based on collections of local information. We use persistent homology techniques to show that in some cases encounter traces can be used to deduce information about the topology of the physical space the experiment was conducted in, and detect certain changes in the space. We also show that one can distinguish between simulated encounter traces generated on a bounded rectangular grid from traces generated on a grid with the opposite edges wrapped (a toroidal grid). Finally, we have found that nontrivial topological features also appear in real experimental encounter traces, and we speculate on types of node behavior that could produce these results. This demonstrates the ability of persistent homology to detect topological features in encounter data that could be diffcult to describe using traditional statistical and geometric methods.
Obstacle collision prevention of mobile robot using force feedback in remote sites
Authors: Soon Mook Jung, Tae Houn Song, Jae Wook Jeon
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Essential surrounding environmental information needed to control remote mobile robots can be garnered from devices such as cameras, and ultrasonic and infrared sensors. Image delay and sensor noise sensitivity may engender inaccuracies in the information collected. Robot control by the user may become difficult. A force feedback controller transmitting a repulsive force to the user can aid recognition of the surrounding environment. This can operate despite the limited image information and uncertain sensor information. It is possible to transmit the magnitude and direction of the repulsive force by a vibration. The controller manages the vibration frequency and the vibration magnitude. A robot displays the information of the surrounding environment on a grid map to calculate the repulsive force of the obstacle. The cells of the grid map are filled with the certainty value of the obstacle. Then, the robot calculates the sum of the repulsive forces of the obstacle by a repulsive force vector calculation. The user can obtain the distance between the obstacle and robot using tactile perception using this method. The user, recognizing the obstacle's distance by the magnitude and duration of the vibration, can navigate the robot at a remote site.
A New Mission for the Information Systems Discipline
Authors: Don Hardaway, Richard G. Mathieu, Richard Will
Venue: Computer (2008)

A revised information systems discipline should require technology to be an integral component of every course.
Determining Optimal Malsburg Gabor Kernel for Efficient Non-Rigid Object Recognition
Authors: Mi-Young Nam, Eun-Sil Yun, Phill-Kyu Rhee
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

. Human face detection and recognition are still challenging questions in pattern recognition field. The facial features such as eyes, nose and mouth are detected in an image which contains a face and the rectangular area surrounding facial features is obtained. To achieve this, Gabor wavelet is the field of interest for many face/object recognition researchers. In this paper, we proposed the adjustable Malsburg Gabor kernel for mouth feature of face image. Mouth feature of face is under the prone effect of facial expression due to variation (noise) and largely affects face recognition system. We improve the Gabor wavelet Kernel for robust face recognition to be adaptable to the mouth. We enlarged the rate of the length to the edge of the kernel because the teeth become interference (noise) for the face recognition. We have designed, implemented and demonstrated our proposed approach addressing this issue. FERET face image dataset have been chosen for training and testing and we have achieved a very good success.
Activity Recognition for the Digital Home
Authors: Jeonghwa Yang, Bill N. Schilit, David W. McDonald
Venue: Computer (2008)

Patterns mined from home networks can support smarter applications.
On Graph Features of Semantic Web Schemas
Authors: Yannis Theoharis, Yannis Tzitzikas, Dimitris Kotzinos, Vassilis Christophides
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

In this paper, we measure and analyze the graph features of Semantic Web (SW) schemas with focus on power-law degree distributions. Our main finding is that the majority of SW schemas with a significant number of properties (resp. classes) approximate a power-law for total-degree (resp. number of subsumed classes) distribution. Moreover, our analysis revealed some emerging conceptual modeling practices of SW schema developers, namely: a) each schema has a few focal classes that have been analyzed in detail (i.e., having numerous properties and subclasses) which are further connected with focal classes defined in other schemas, b) the class subsumption hierarchies are mostly unbalanced (i.e., some branches are deep and heavy, while others are shallow and light), c) most properties have as domain/range classes that are located highly at the class subsumption hierarchies and d) the number of recursive/multiple properties is significant. The knowledge of these features is essential for guiding synthetic SW schema generation, which is an important step towards benchmarking SW repositories and query languages implementations.
The Impact of Employee Participation on the Use of an Electronic Process Guide: A Longitudinal Case Study
Authors: Torgeir Dingsoyr, Nils Brede Moe
Venue: IEEE Transactions on Software Engineering (2008)

Many software companies disseminate process knowledge through electronic process guides. A common problem with such guides is that they are not used in practice. Through a case study we investigated how involvement in creating an electronic process guide through process workshops influenced the use of the process guide. We studied developer and project manager usage through three aspects: Use frequency, used functionality and reported advantages and disadvantages. We collected data from three rounds of interviews and 19 months of usage logs in a longitudinal study in a medium-size software company. Workshop participants show a higher degree of usage, use a larger number of functions, and express more advantages and disadvantages than non-participants. Our study suggests that employee involvement has a long-term positive effect on electronic process guide usage.