ppxscal/embedding_network huggingface dataset:
Proceedings of the 19th annual symposium on Integrated circuits and systems design
Venue: SBCCI (2006)

It is our great pleasure to welcome you to the 19th Symposium Integrated Circuits and Systems Design -- SBCCI'06. This year's symposium is being organized by Federal University of Minas Gerais and Federal University of Ouro Preto, and continues its tradition of being one of the most important forums for presentation of research results and experience reports on leading edge issues of integrated circuits and systems design. It is being held in conjunction with the 21st Symposium on Microelectronics Technology and Devices --- SBMicro'06 and a Student Forum on the same subject, under the umbrella name of Chip in the Mountains. The events are hosted in Ouro Preto, an historical city dating from the colonial times.The call for papers attracted 95 submissions from Asia, North America, Europe, Middle East, and the South America. The Program Committee accepted 39 papers that cover a variety of topics, including dedicated and reconfigurable architectures, CAD tools, embedded systems, test and verification, formal methods and analog and digital design. We hope that these proceedings will serve as a valuable reference for researchers and developers in these areas.Leading edge researchers from several regions from all over the world composed the Program Committee, including North America, South America, Europe, Asia and Oceania. We would like to express our gratitude to the them and to the external reviewers who worked very hard in reviewing papers and providing suggestions for their improvements.The Technical Program of SBCCI is enriched by many highlights: 2 keynote speakers, 3 tutorials, 3 invited talks and panels. One keynote by Professor Hartenstein addresses the issue of power consumption cost in high performance computing, a problem of multimillion dollars bills. Another keynote by Andrès Lagos addresses high performance silicon MEMs. The tutorials cover IC design topics such as formal verification, low power computing and reconfigurable computing. The invited talks deal with hot topics like adaptive embedded systems, IC verification and circuit timing speculation. Moreover, this year we have again a student design contest by one of the major FPGA companies. This exciting technical program is developed in the beautiful surroundings of Ouro Preto, along with social activities and cultural events. Ouro Preto is a UNESCO World Heritage Center featuring steep streets and well preserved Portuguese colonial houses, surrounded by mountains and nature.
A payment & receipt business model in U-commerce environment
Authors: Kyoung Jun Lee, Jeong-In Ju, Jeong Mu Jeong
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

The key to U-payment is convenience and security in the transfer of financial information. The purpose of this paper is to find a desirable U-payment scheme promoting seamlessness and privacy with a consumer device and peer-based information transactions. We also propose a new business model through digital receipt which is evidence of commercial decision making and transaction. We propose U-PR (Ubiquitous Payment and Receipt) business model and method as a way to make transactions seamless, secure and privacy protected.
Phonotactic Knowledge and Lexical&ndash;Semantic Processing in One-year-olds: Brain Responses to Words and Nonsense Words in Picture Contexts
Authors: Manuela Friedrich, Angela D. Friederici
Venue: Journal of Cognitive Neuroscience (2005)

During their first year of life, infants not only acquire probabilistic knowledge about the phonetic, prosodic, and phonotactic organization of their native language, but also begin to establish first lexical&ndash;semantic representations. The present study investigated the sensitivity to phonotactic regularities and its impact on semantic processing in 1-year-olds. We applied the method of event-related brain potentials to 12- and 19-month-old children and to an adult control group. While looking at pictures of known objects, subjects listened to spoken nonsense words that were phonotactically legal (pseudowords) or had phonotactically illegal word onsets (nonwords), or to real words that were either congruous or incongruous to the picture contents. In 19-month-olds and in adults, incongruous words and pseudowords, but not nonwords, elicited an N400 known to ref lect mechanisms of semantic integration. For congruous words, the N400 was attenuated by semantic priming. In contrast, 12-month-olds did not show an N400 difference, neither between pseudo- and nonwords nor between incongruous and congruous words. Both 1-year-old groups and adults additionally displayed a lexical priming effect for congruous words, that is, a negativity starting around 100 msec after words onset. One-year-olds, moreover, displayed a phonotactic familiarity effect, that is, a widely distributed negativity starting around 250 msec in 19-month-olds but occurring later in 12-month-olds. The results imply that both lexical priming and phonotactic familiarity already affect the processing of acoustic stimuli in children at 12 months of age. In 19-month-olds, adult-like mechanisms of semantic integration are present in response to phonotactically legal, but not to phonotactically illegal, nonsense words, indicating that children at this age treat pseudowords, but not nonwords, as potential word candidates.
Salient Contour Detection using a Global Contour Discontinuity Measurement
Authors: Hongzhi Wang, John Oliensis
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Salient contour grouping/detection is one of the major topics in perceptual organization exploring the true meanings for contours. Extending contour's discontinuity quality from low level discontinuity, we introduce a new perspective that a salient contour represents a sharp change in the ability to organize the image into meaningful parts. This new view gives a novel, general edge energy measure, which has important perceptual meanings. A new multiscale saliency function and its variational solution are also described. Experiments on real images validate our method.
Human Face Reconstruction Using Bayesian Deformable Models
Authors: George Mamic, Clinton Fookes, Sridha Sridharan
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

This paper presents a Bayesian framework for 3D facial reconstruction. The framework iteratively deforms a generic face mesh to fit a set of range points representing a face. The generic mesh is generated from the extensive FRGC database of face images. The deformation process is conducted within a Bayesian framework and is driven by a Markov Chain Monte Carlo (MCMC) sampler which uses information from the likelihood and prior distributions of the generic face mesh. The paper presents results on the construction of a generic face model, the deformation framework and fitting results to both synthetic and real data. The results verify the effectiveness of the proposed technique, accurately deforming a generic face mesh to captured 3D data points of human faces.
An Empirical Study for Quantitative Evaluation of Game Satisfaction
Authors: HyungBum Ham, YangSun Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Improvement of electronic games, and increased trade and competitiveness of the electronic gaming industry require evaluation of the satisfaction level of the users. Statistical analysis is the key to quantitatively assessing both existing games and to help develop new ones. This research paper proposes a system in which game satisfaction can be quantitatively evaluated according to a standardized scale and that presents a rational analysis of online games. This method will enable the industry to anticipate, for example, the varying degrees of game satisfaction, and their distribution, and any technical improvements that need to be implemented.
Modeling and Evaluation of Software Systems with Object Stochastic Activity Networks
Authors: Mohammad Abdollahi Azgomi, Ali Movaghar
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Stochastic activity networks (SANs) are a stochastic generalization of Petri nets. SAN models have been used to evaluate a wide range of systems and are supported by several modeling tools. We have introduced object stochastic activity networks (OSANs) to overcome some restrictions of these models. OSANs integrate the concepts of object-orientation into SAN models. Elements of OSANs and their submodels are defined as classes. OSANs are more appropriate that most other objectoriented or high-level extensions of Petri nets for application on software systems. In this paper, we will present the definitions, behavior and an example of OSAN models. The objectorientation of OSANs and the flexibility of having functions for activities, make these models more appropriate than other extensions of Petri nets for modeling and evaluation of software systems.
Fair Coalitions for Power-Aware Routing in Wireless Networks
Authors: Ratul K. Guha, Carl A. Gunter, Saswati Sarkar
Venue: IEEE Transactions on Mobile Computing (2007)

Several power-aware routing schemes have been developed for wireless networks under the assumption that nodes are willing to sacrifice their power reserves in the interest of the network as a whole. But, in several applications of practical utility, nodes are organized in groups, and as a result, a node is willing to sacrifice in the interest of other nodes in its group but not necessarily for nodes outside its group. Such groups arise naturally as sets of nodes associated with a single owner or task. We consider the premise that groups will share resources with other groups only if each group experiences a reduction in power consumption. Then, the groups may form a coalition in which they route each other's packets. We demonstrate that sharing between groups has different properties from sharing between individuals and investigate fair, mutually beneficial sharing between groups. In particular, we propose a pareto-efficient condition for group sharing based on max-min fairness called fair coalition routing. We propose distributed algorithms for computing the fair coalition routing. Using these algorithms, we demonstrate that fair coalition routing allows different groups to mutually beneficially share their resources.
Specifying, Interpreting and Detecting High-level, Spatio-Temporal Composite Events in Single and Multi-Camera Systems
Authors: Senem Velipasalar, Lisa M. Brown, Arun Hampapur
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Detecting and tracking moving objects are important and challenging problems which have attracted much attention from the research community. However, in most cases, it is not enough to only track the objects. The goal should be to detect the occurrences of events of interest, which is important for applications such as video surveillance, video browsing and indexing. Yet, event detection introduces the challenge of providing the flexibility to specify customized events with varying complexity, and entering them to a system in a generic way. The event definitions should not be pre-defined and hard-coded. We introduce a spatio-temporal event detection system which lets the users to specify multiple composite events of high-complexity, and then detects their occurrence automatically. Events can be defined on a single camera view or across multiple camera views. Semantically higher level event scenarios can be built by using the building blocks, which we call the primitive events, and combining them by operators. More importantly, the newly defined composite events can be combined with each other. This layered structure makes the definition of events with higher and higher complexity possible. The event definitions are written to an XML file, which is then parsed and communicated to the tracking engines running on the videos of the corresponding cameras. With the proposed system, we have reached the next level and managed to go from detecting "a person exiting the building" to detecting "a person coming from the south corridor of the building and then exiting the building".
Debugging Trellis Decoding of Augmented RAC Array Codes Using a Visual Tool
Authors: Lami Kaya, Mohammad Al-Qudah
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Two-dimensional (2D) row and column (RAC) codes are constructed from single parity check (SPC) component codes. Parity check positions of a RAC code can be augmented to improve code rate, resulting augmented RAC (ARAC) code. The augmentation process can be conducted on only row-parity check positions (ARAC-R), or on both row/column positions (ARAC-RC). A visual tool for debugging the process of Viterbi algorithm (VA) decoding of these codes has been designed and implemented. The ARAC code parameters can be selected through a pull-down menu and accordingly a trellis diagram is constructed. Based on the received data, branch-metrics, pathmetrics, and surviving path details all can be visually viewed on the trellis diagram. The tool provides an interface for introducing errors at specific array positions and their effect on output sequence can be easily determined.
An InfoStation-Based University Campus System for the Provision of mLearning Services
Authors: Ivan Ganchev, Stanimir Stojanov, Mairtin O'Droma, Damien Meere
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper presents an InfoStation-based multiagent system, which provides mobile eLearning (mLearning) services in a University Campus area. A description of some of the mLearning services along with sample entities' interaction is provided. Technologies for delivering of these services are discussed, and approaches for the system implementation and structuring are considered.
Approximative filtering of XML documents in a publish/subscribe system
Authors: Annika Hinze, Yann Michel
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Publish/subscribe systems filter published documents and inform their subscribers about documents matching their interests. Recent systems have focussed on documents or messages sent in XML format. Subscribers have to be familiar with the underlying XML format to create meaningful subscriptions. A service might support several providers with slightly differing formats, e.g., several publishers of books. This makes the definition of a successful subscription almost impossible. This paper proposes the use of an approximative language for subscriptions. We introduce the design of our ApproXFilter algorithm for approximative filtering in a publish/subscribe system. We present the results of our performance analysis of a prototypical implementation.
Visual Search and Dual Tasks Reveal Two Distinct Attentional Resources
Authors: Rufin Vanrullen, Lavanya Reddy, Christof Koch
Venue: Journal of Cognitive Neuroscience (2004)

Most theories of visual processing assume that a target will "pop out" from an array of distractors ("parallel" visual search, e.g., color or orientation discrimination) if targets and distractors can be discriminated without attention. When the discrimination requires attention (e.g., rotated L vs. T or red-green vs. green-red bisected disks), "serial" examination is needed in visual search. Attentional requirements are also frequently assessed by measuring interference from a concurrently performed attentionally demanding task. It is commonly believed that attention acts equivalently in dual-task and visual search paradigms, based on the implicit assumption that visual attentional requirements can be defined along a single dimension. Here we show that there is no such equivalence: We report on targets that do not trigger pop-out, even though they can be discriminated from distractors with attention occupied elsewhere (natural scenes, color-orientation conjunctions); conversely, we show that certain targets that pop out among distractors need undivided attention to be effectively discriminated from distractors when presented in isolation (rotated L vs. +, depth-rotated cubes). In other words, visual search and dual-task performance reveal attentional resources along two independent dimensions. We suggest an interpretation of these results in terms of neuronal selectivities and receptive field size effects.
The Role of Anterior Cingulate Cortex in Working Memory is Shaped by Functional Connectivity
Authors: Agatha Lenartowicz, Anthony R. Mcintosh
Venue: Journal of Cognitive Neuroscience (2005)

The anterior cingulate (AC) cortex seems to be similarly engaged by attentional and memory processes. We tested the hypothesis that this common activation is best explained by changes in the regions interacting (functionally connected) with AC. Subjects were tested on two variants of a 2-back working memory task: a standard version with strong attentional demands, and a cued version that more strongly promoted memory retrieval. AC activation, measured with functional MRI, was found in both tasks, although more sustained in the standard condition. The regions functionally connected to the AC, and the relation of these activity patterns to memory performance, were completely different across tasks. In the standard task, the pattern related to a speed&ndash;accuracy tradeoff, whereas the connectivity pattern unique to the cued task related only to better accuracy. By virtue of these changing patterns of functional connectivity, the contribution of AC to attention- and memory-driven performance was similarly changed.
Nonlinear processes and control of chaos in chemical technology
Authors: E. M. Koltsova, M. V. Cherenkov, E. Y. Korchagin
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

Two methods of controlling chaotic oscillations are considered: with feedback and without feedback (destochastization). The process of continuous mass crystallization of dibasic lead phosphite (at the expense of chemical reaction) is considered. The mathematical model of such a process forecasts as periodic so and chaotic oscillations. The feedback algorithm of Ott-Grebogi-Yorke (OGY) was modified for stabilization of period-2 cycle. It was shown that the main equations of the mathematical model could be resulted in the logistic type equations. The correlation was found between the bifurcation parameter of the mathematical model (flow rate) and the bifurcation parameter of the logistic equation. The periodic perturbation was built for the bifurcation parameter (flow rate), which regulate the chaotic oscillations to the period-6 cycle (destochastization algorithm).
An adaptive ESPRIT based on URV decomposition
Authors: K. J. R. Liu, D. P. O'Leary, G. W. Stewart, Y.-J. J. Wu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

ESPRIT is an algorithm for determining the fixed directions of arrival of a set of narrowband signals at an array of sensors. Its computational burden makes it unsuitable for real-time processing of signals with time-varying directions of arrival. The authors develop a new implementation of ESPRIT that has potential for real-time processing. It is based on a rank-revealing URV decomposition, rather than the eigendecomposition or singular value decomposition (SVD) used in previous ESPRIT algorithms. Its performance is demonstrated on simulated data representing both constant and time-varying signals. It is shown that the URV-based ESPRIT algorithm is effective for estimating time-varying directions-of-arrival at considerable computational savings over the SVD-based algorithm.
Cascaded Encryption Through Recursive Carry Addition and Key Rotation (CRCAKR) of a Session Key
Authors: P. K. Jha, J. K. Mandal
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

The technique considers a message as binary string on which a Cascaded Recursive Carry Addition and Key Rotation (CRCAKR) is applied. This technique uses binary addition method. It is a kind of block cipher and symmetric in nature hence, decoding is done following the same procedure. A comparison of the proposed technique with existing RSA and Triple DES has also been done in terms of frequency distribution and homogeneity of source and encrypted files.
Adaptive mechanism design: a metalearning approach
Authors: David Pardoe, Peter Stone, Maytal Saar-Tsechansky, Kerem Tomak
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

Auction mechanism design has traditionally been a largely analytic process, relying on assumptions such as fully rational bidders. In practice, however, bidders often exhibit unknown and variable behavior, making them difficult to model and complicating the design process. To address this challenge, we explore the use of an adaptive auction mechanism: one that learns to adjust its parameters in response to past empirical bidder behavior so as to maximize an objective function such as auctioneer revenue. In this paper, we give an overview of our general approach and then present an instantiation in a specific auction scenario. In addition, we show how predictions of possible bidder behavior can be incorporated into the adaptive mechanism through a metalearning process. The approach is fully implemented and tested. Results indicate that the adaptive mechanism is able to outperform any single fixed mechanism, and that the addition of metalearning improves performance substantially.
Parallel Pattern-Based Systems for Computational Biology: A Case Study
Authors: Weiguo Liu Bertil Schmidt
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Computational biology research is now faced with the burgeoning number of genome data. The rigorous postprocessing of this data requires an increased role for high-performance computing (HPC). Because the development of HPC applications for computational biology problems is much more complex than the corresponding sequential applications, existing traditional programming techniques have demonstrated their inadequacy. Many high level programming techniques, such as skeleton and pattern-based programming, have therefore been designed to provide users new ways to get HPC applications without much effort. However, most of them remain absent from the mainstream practice for computational biology. In this paper, we present a new parallel pattern-based system prototype for computational biology. The underlying programming techniques are based on generic programming, a programming technique suited for the generic representation of abstract concepts. This allows the system to be built in a generic way at application level and, thus, provides good extensibility and flexibility. We show how this system can be used to develop HPC applications for popular computational biology algorithms and lead to significant runtime savings on distributed memory architectures.