ppxscal/embedding_network huggingface dataset:
Picosecond delay adjustment for 12.8 Gbps multiplexed testing
Authors: D. C. Keezer, D. Minier, P. Ducharme
Venue: Proceedings of the 2008 IEEE 14th International Mixed-Signals, Sensors, and Systems Test Workshop (2008)

A novel high-bandwidth adjustable delay circuit is described that is used for XOR-based multiplexing of multi-Gbps test signals. By precisely-aligning the phase offset of two 6.4Gbps ATE signals, an Indium-Phosphide exclusive-OR gate is used to synthesize a double-data-rate signal with picosecond resolution and ∼30ps accuracy. The delay circuit is based on an experimentally-observed second-order effect in a SiGe variable-amplitude differential buffer. A 2-channel module for testing serial and parallel signals up to 12.8Gbps is described. The performance of the module is demonstrated between 6.4Gbps and 12.8Gbps.
Leveraging New Plans in AgentSpeak(PL)
Authors: Felipe Meneguzzi, Michael Luck
Venue: Declarative Agent Languages and Technologies VI: 6th International Workshop, DALT 2008, Estoril, Portugal, May 12, 2008, Revised Selected and Invited Papers (2008)

In order to facilitate the development of agent-based software, several agent programming languages and architectures, have been created. Plans in these architectures are often self-contained procedures with an associated triggering event and a context condition, while any further information about the consequences of executing a plan is absent. However, agents designed using such an approach have limited flexibility at runtime, and rely on the designer's ability to foresee all relevant situations an agent might have to handle. In order to overcome this limitation, we have created AgentSpeak(PL), an interpreter capable of performing state-space planning to generate new high-level plans. As the planning module creates new plans, the plan library is expanded, improving performance over time. However, for new plans to be useful in the long run, it is critical that the context conditions associated with new plans are carefully generated. In this paper we describe a plan reuse technique aimed at improving an agent's runtime performance by deriving optimal context conditions for new plans, allowing an agent to reuse generated plans as much as possible.
Gesture recognition in flow based on PCA analysis using multiagent system
Authors: Ronan Billon, Alexis Nédélec, Jacques Tisseau
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Our context is Virtual Theater. Our aim is to put on a short play featuring a real actor and a virtual actor, who will communicate through movements and choreography with mutual synchronization. We currently work on a system that can recognize key-gestures made by a real actor. In this paper, we cover a method for real-time recognition. Our idea is that the data for movements from any motion-capture system can be reduced to a single artificial signature. We use properties from Principal Component Analysis (PCA) to generate it. This artificial gesture representation is used in real-time by our multiagent systems to simultaneously perform segmentation (gesture's beginning and end) and recognition. We conducted various experiments which demonstrate our system and define its limitations.
Timing driven power gating in high-level synthesis
Authors: Shih-Hsu Huang, Chun-Hua Cheng
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

The power gating technique is useful in reducing standby leakage current, but it increases the gate delay. For a functional unit, its maximum allowable delay (for a target clock period) limits the smallest standby leakage current its power gating can achieve. In this paper, we point out: in the high-level synthesis of a non-zero clock skew circuit, the resource binding (including functional units and registers) has a large impact on the maximum allowable delays of functional units; as a result, different resource binding solutions have different standby leakage currents. Based on that observation, we present the first work to draw up the timing driven power gating in high-level synthesis. Given a target clock period and design constraints, our goal is to derive the minimum-standby-leakage-current resource binding solution. Benchmark data show: compared with the existing design flow, our approach can greatly reduce the standby leakage current without any overhead.
Medical Digital Library Services as an Improvement of the Teleconsultation System in the Regional Health Network
Authors: Michal Kosiedowski, Cezary Mazurek, Maciej Stroinski, Jan Weglarz
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

ICT systems supporting the process of consultation in medicine are of significant importance in today's healthcare and are being deployed as region- or country-wide teleconsultation networks. We are involved in the implementation of such a medical teleconsultation network for the benefit of hospitals in Wielkopolska, Poland. While we believe in huge improvement of the regional healthcare thanks to the deployment of a medical teleconsultation system, we are concerned whether this is enough, especially in the context of a very high expected number of transactions and limited amount of medical competence in certain areas. We therefore introduced the concept of providing a number of services built within the Medical Digital Library as an improvement of the medical teleconsultation system in the Wielkopolska regional health network. In this paper we discuss advantages of implementing a Medical Digital Library in the Wielkopolska health network, basing on our practical experience in digital library deployments.
A Load Balancing Knapsack Algorithm for Parallel Fuzzy c-Means Cluster Analysis
Authors: Marta V. Modenesi, Alexandre G. Evsukoff, Myrian C. Costa
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

This work proposes a load balance algorithm to parallel processing based on a variation of the classical knapsack problem. The problem considers the distribution of a set of partitions, defined by the number of clusters, over a set of processors attempting to achieve a minimal overall processing cost.The work is an optimization for the parallel fuzzy c-means (FCM) clustering analysis algorithm proposed in a previous work composed by two distinct parts: the cluster analysis, properly said, using the FCM algorithm to calculate of clusters centers and the PBM index to evaluate partitions, and the load balance, which is modeled by the multiple knapsack problem and implemented through a heuristic that incorporates the restrictions related to cluster analysis in order to gives more efficiency to the parallel process.
Simulation-Based Engineering of Complex Systems, 2nd edition
Authors: John R. Clymer
Venue:  (2009)

This book is intended as a senior elective and graduate level textbook (homework solution manual available) and a practitioner's reference book. It is mainly intended for systems engineers, integrated product engineers, software engineers, industrial/manufacturing engineers, business management design people, and Intelligent Enterprises (IE) people. The book can also be used in any field that is concerned with collaborating/conflicting entities that perform a set of tasks that lead to satisfaction of a measurable goal that may or may not be explicitly known or stated. Such fields include, in addition to those mentioned above, societal systems and sociology, biological and ecological systems, economic systems, and others. There is currently no book that covers the basic principles of complex systems in such a way that students and practitioners can readily extend these principles to all kinds of systems through hands-on experimentation using an icon-based simulation tool.
A Hardware Task Scheduler for Embedded Video Processing
Authors: Ghiath Al-Kadi, Andrei Sergeevich Terechko
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

Modern embedded Systems-on-a-Chip deploy multiple programmable cores to meet increasing performance requirements of video, graphics, and modem applications. However, software implementations of task scheduling and inter-task synchronization often limit performance improvements of multicores. Remarkably, several demanding video applications (e.g. H.264 video decoding) rely on task dependency graphs that can be constructed from a simple dependency pattern. Based on such a pattern, our novel hardware task scheduler can quickly create, order, synchronize and map tasks to cores. We found that our hardware task scheduler speeds up a Quad HD H.264 video decoding by 1.17 times compared to a chip multi-processor with a state-of-the-art hardware task queues. Moreover, our hardware task scheduler allows decreasing the number of cores needed to meet the real-time performance requirements for the H.264 decoder and, consequently, reduces the silicon area of the multicore by up to 12.5%.
Implementation of Program Behavior Anomaly Detection and Protection Using Hook Technology
Authors: Jianfang Shen, Lianglun Cheng, Xiufen Fu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Windows is an operating system based on message which is built on event—driven mechanism. Hook is one of surveillance point of message processing mechanism in Windows system. In this paper using Windows kernel technology, using Hook Service Table to replace Native's API, detect process and thread behavior, and realize detection and protection of registry and file and process. A program behavior anomaly detection and protection system is designed and implemented in Windows operating system. Hook and some key techniques of Hook are introduced, system frame and key technology of this system. At last, the experimental result validated the feasibility and availability of this system．
Research on the Application of K-means Cluster Analysis in Undergraduate Instructional Management
Authors: Jie Yao
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Through probing into the application of K-means cluster analsis in the daily instructional management, our teacher can know how to make good use of multivariate statistical analysis software SPSS to analyze students' scores. Thus it can help the teachers know better about how the students have grasped and understood each course. And it can also help the teachers understand the course structure and clarify the interactive relationship among these courses so that they could teach students according to their aptitude and improve instructional quality constantly.
A Mechanism to Create Community Maps for Non-technical Users
Authors: Claire Ellul, Mordechai (Muki) Haklay, Louise Francis, Hanif Rahemtulla
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

The Mapping Change for Sustainable Communities project is designed to assist community groups towards greater participation in local decision making by providing them with an interactive map showing local information. The maps are managed and moderated by each community and display themes of their choice– much like a map-based community forum. Although initially targeted at only four community groups, interest in the project resulted in the requirement to provide maps for a much wider audience, ranging from faith groups to local doctors' surgeries. Each map requires differently-themed data. The project is managed by staff from London21 (a London-based network of community groups). Given a lack of in-house programming skills (Google Maps, MySQL, JavaScript, PHP), a method is required to allow them to set up new community sites and to add custom themes to the sites as required by each group. This paper presents a technical account of this mechanism, along with a brief description of the project and its outcomes.
Fixed Point Theorems on Partial Randomness
Authors: Kohtaro Tadaki
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

In our former work [K. Tadaki, Local Proceedings of CiE 2008, pp. 425---434, 2008], we developed a statistical mechanical interpretation of algorithmic information theory by introducing the notion of thermodynamic quantities, such as free energy F(T), energy E(T), and statistical mechanical entropy S(T), into the theory. We then discovered that, in the interpretation, the temperature T equals to the partial randomness of the values of all these thermodynamic quantities, where the notion of partial randomness is a stronger representation of the compression rate by program-size complexity. Furthermore, we showed that this situation holds for the temperature itself as a thermodynamic quantity. Namely, the computability of the value of partition function Z(T) gives a sufficient condition for T &sube; (0,1) to be a fixed point on partial randomness. In this paper, we show that the computability of each of all the thermodynamic quantities above gives the sufficient condition also. Moreover, we show that the computability of F(T) gives completely different fixed points from the computability of Z(T).
Application of Wavelet Analysis in Fault Detection of Cell Phone Vibration Motor
Authors: Li Chang, Fenglin Luo
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

It is easy to find that the rotor of the cell phone vibration motor touches its outer case or magnet during assemblage, due to the poor verticality of shaft or jet burr. It is a fatal fault to result in the rejection. The main method to detect this kind of fault is the manual work up to now. The paper puts forward a high sensitive and automatic fault detection system based on MEMS, embedded system and wavelet transform. The micromachined accelerometer converted the vibration signal of the cell phone vibration motor into the voltage output signal, the embedded system S3C44BOX with internal A/D acquired the voltage and stored in itself memory, wavelet transform with powerful ability to detect transient component analyzed the data and diagnosed the fault. Experimental results show that the fault can be identified accurately and efficiently, which is significant to insure the quality of product and guide practical production.
New definition of locally convex L-topological vector spaces
Authors: Hua-Peng Zhang, Jin-Xuan Fang
Venue: Fuzzy Sets and Systems (2009)

In this paper, a new definition of locally convex L-topological vector spaces is given. The relationship between this new definition and the previous definition of locally convex L-topological vector spaces given by Yan and Fang in 1999 is investigated. Moreover, the concept of generalized L-fuzzy semi-norm is introduced. By using a family of generalized L-fuzzy semi-norms, a characterization of the new locally convex L-topological vector spaces is presented. Finally, as applications of this characterization, the Hausdorff separation property, convergence of molecule nets and boundedness of L-fuzzy sets in locally convex L-topological vector spaces are studied.
Incremental reconstruction of generalized Voronoi diagrams on grids
Authors: Nidhi Kalra, Dave Ferguson, Anthony Stentz
Venue: Robotics and Autonomous Systems (2009)

We present an incremental algorithm for constructing and reconstructing Generalized Voronoi Diagrams (GVDs) on grids. Our algorithm, Dynamic Brushfire, uses techniques from the path planning community to efficiently update GVDs when the underlying environment changes or when new information concerning the environment is received. Dynamic Brushfire is an order of magnitude more efficient than current approaches. In this paper we present the algorithm, compare it to current approaches on several experimental domains involving both simulated and real data, and demonstrate its usefulness for multirobot path planning.
Scale cross-ambiguity and target resolution
Authors: Douglas J. Nelson, David C. Smith
Venue: Digital Signal Processing (2009)

We derive the correct formulation of the Doppler problem in which the received signal is scaled in time by a scale factor dependent on the relative radial velocity of the transmitter and the receiver, normalized by the propagation speed in the transmission medium. For sine waves, the conventional Doppler model in which the received signal is translated in frequency is equivalent to the scale model. However, for signals with non zero bandwidth, the difference can be quite significant, as we demonstrate. We further demonstrate simple methods, based on the discrete Fourier transform (DFT) and phase differentiation of the scale CAF, by which delay and scale may be accurately estimated.
Towards an Understanding of Collaboration in Teaching Technology Subjects in an Amalgamated Faculty of Engineering and Information Technology
Authors: Elaine Lawrence, Lian Loke, Richard Raban, Wayne Brookes, Tim Aubrey
Venue: Proceedings of the 2009 International Conference on Mobile, Hybrid, and On-line Learning (2009)

The paper sets out a collaborative approach for teaching technology subjects. It illustrates the benefits of this approach over the single academic owning a particular subject. The paper presents preliminary findings from interviews with academics in a newly combined Faculty of Engineering and Information Technology. It concludes by pointing the way to the future of this funded research project.
Oliver G. Selfridge (1926-2008)
Authors: James Hendler
Venue: IEEE Intelligent Systems (2009)

Oliver G. Selfridge, a leader in early artificial intelligence research, whose work extended from 1956 to 2008, recently passed away. His research in machine learning, neural networks and agent-based computing still influence AI today. He helped organize the 1956 Dartmouth summer school, which is generally seen as the origin of American AI and developed Pandemonium, an early AI program that dealt with learning and reasoning, during his more than 50-year career.
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
Authors: V. W. Marek, J. B. Remmel
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Using a characterization of stable models of logic programs P as satisfying valuations of a suitably chosen propositional theory, called the set of reduced defining equations r&Phi; P , we show that the finitary character of that theory r&Phi; P is equivalent to a certain continuity property of the Gelfond-Lifschitz operator ${\mathit{GL}}_P$ associated with the program P. The introduction of the formula r&Phi; P leads to a double-backtracking algorithm for computation of stable models by reduction to satisfiability of suitably chosen propositional theories. This algorithm does not use the reduction via loop-formulas as proposed in [1] or its extension proposed in [2]. Finally, we discuss possible extensions of techniques proposed in this paper to the context of cardinality constraints.
Adaptive Optimizations for Surveillance Sensor Network Longevity
Authors: R. R. Brooks, Hemanth Siddulugari
Venue: International Journal of Distributed Sensor Networks (2009)

Sensor networks are typically wireless networks composed of resource-constrained battery powered devices. In this paper, we present a criterion for determining whether or not a surveillance sensor network is viable. We use this criterion to compare methods for extending the effective lifetime of the sensor network. The life extension methods we consider are local adaptations that reduce the energy drain on individual nodes. They are communications range management, node repositioning, and data agreement. Simulations of a surveillance scenario quantify the utility of these methods. Our results indicate that data agreement provides the most improvement in network longevity, and communications range management is also useful. Repositioning nodes to reduce the power needed for communications is dependent on the amount of attenuation experienced by the node's communications signal and the volume of traffic between nodes. When these factors are considered, node repositioning is an effective strategy for network life extension. Synergies between the energy conservation approaches are also explored.
Exotic Quantifiers, Complexity Classes, and Complete Problems
Authors: Peter B&#x00fc;rgisser, Felipe Cucker
Venue: Foundations of Computational Mathematics (2009)

We define new complexity classes in the Blum&#x2013;Shub&#x2013;Smale theory of computation over the reals, in the spirit of the polynomial hierarchy, with the help of infinitesimal and generic quantifiers. Basic topological properties of semialgebraic sets like boundedness, closedness, compactness, as well as the continuity of semialgebraic functions are shown to be complete in these new classes. All attempts to classify the complexity of these problems in terms of the previously studied complexity classes have failed. We also obtain completeness results in the Turing model for the corresponding discrete problems. In this setting, it turns out that infinitesimal and generic quantifiers can be eliminated, so that the relevant complexity classes can be described in terms of the usual quantifiers only.
Spotting Significant Changing Subgraphs in Evolving Graphs
Authors: Zheng Liu, Jeffrey Xu Yu, Yiping Ke, Xuemin Lin, Lei Chen
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Graphs are popularly used to model structural relationships between objects. In many application domains such as social networks, sensor networks and telecommunication, graphs evolve over time. In this paper, we study a new problem of discovering the subgraphs that exhibit significant changes in evolving graphs. This problem is challenging since it is hard to define changing regions that are closely related to the actual changes (i.e., additions/deletions of edges/nodes) in graphs. We formalize the problem, and design an efficient algorithm that is able to identify the changing subgraphs incrementally. Our experimental results on real datasets show that our solution is very efficient and the resultant subgraphs are of high quality.
Bezel swipe: conflict-free scrolling and multiple selection on mobile touch screen devices
Authors: Volker Roth, Thea Turner
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Zooming user interfaces are increasingly popular on mobile devices with touch screens. Swiping and pinching finger gestures anywhere on the screen manipulate the displayed portion of a page, and taps open objects within the page. This makes navigation easy but limits other manipulations of objects that would be supported naturally by the same gestures, notably cut and paste, multiple selection, and drag and drop. A popular device that suffers from this limitation is Apple's iPhone. In this paper, we present Bezel Swipe, an interaction technique that supports multiple selection, cut, copy, paste and other operations without interfering with zooming, panning, tapping and other pre-defined gestures. Participants of our user study found Bezel Swipe to be a viable alternative to direct touch selection.
A comparative approach for contour detection of brain tumors by using image correlation techniques on tomography images
Authors: Baki Koyuncu, Alper Pahsa
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

In this study, contours of a brain tumor on a single slice tomography image were derived by using image correlation technique. Four different methods were used to compare the validity of the derived contours. Contour map of the brain tumor was generated by using 2D image correlation technique with raw pixel, perceived brightness (luminance), optical density and Relative radiation dose data. The resultant contour maps were the same in all methods. They produced the digital data for any remote surgical device to remove the tumor area.