ppxscal/embedding_network huggingface dataset:
Phase synchronization in ensembles of coupled phase systems
Authors: V. N. Belykh
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

This paper deals with the problem of phase synchronization in networks of coupled limit-cycle and chaotic dynamical systems. This work explores the impact of the structure and bifurcation properties of regular and chaotic attractors of the coupled phase system on phase locking and phase synchronization.
GHIDS: Defending Computational Grids against Misusing of Shared Resources
Authors: Guofu Feng, Xiaoshe Dong, Weizhe Liu, Ying Chu, Junyang Li
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Detecting intrusions at host level is vital to protecting shared resources in grid, but traditional Host-based Intrusion Detecting System (HIDS) is not suitable for grid environment. Grid-specific attacks are different from traditional ones, and traditional HIDS can not recognize a grid user and always with high performance overhead. This paper proposes a Grid- specific Host-based Intrusion Detection System (GHIDS) which employs bottleneck verification approach to detect intrusions with low false alarm rate and high detection rate. Working within operating system kernel and performing bottleneck verification by integer comparison, GHIDS achieves high efficiency and accuracy. Security reports generated by GHIDS are indexed not only by local user ID, but also by Grid user ID. That is more useful for analyzing grid user behaviors globally by both host administrators and high level Grid-based IDS.
Self-tuning wireless network power management
Authors: Manish Anand, Edmund B. Nightingale, Jason Flinn
Venue: Wireless Networks (2005)

Current wireless network power management often substantially degrades performance and may even increase overall energy usage when used with latency-sensitive applications. We propose self-tuning power management (STPM) that adapts its behavior to the access patterns and intent of applications, the characteristics of the network interface, and the energy usage of the platform. We have implemented STPM as a Linux kernel module--our results show substantial benefits for distributed file systems, streaming audio, and thin-client applications. Compared to default 802.11b power management, STPM reduces the total energy usage of an iPAQ running the Coda distributed file system by 21% while also reducing interactive file system delay by 80%. Further, STPM adapts to diverse operating conditions: it yields good results on both laptops and handhelds, supports 802.11b network interfaces with substantially different characteristics, and performs well across a range of application network access patterns.
Holonic Multi-agent Systems to Integrate Independent Multi-sensor Platforms in Complex Surveillance
Authors: J. J. Valencia-Jimenez, Antonio Fernandez-Caballero
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

As far as a surveillance system is always integrated in an environment it has to adapt to possible changes that can occur in it. For this reason, it is not sufficient to install a series of sensors along the facilities to be guarded, as any modifications enormously increment the amount of data to be interpreted. Also, eventual failures or sabotages to the sensors produce the collapse of the system, which is not convenient at all in a potentially dangerous environment. Thus, the natural evolution of these systems is the integration in a compact system of intelligent platforms, which are able or not of moving in the environment, which possess several and complementary sensor types, and which interpret the information of each sensor coherently to offer the platform itself a fair service of surveillance. Quality of service is notably increased when there are a sufficient number of platforms forming a compact multi-agent system (MAS). Moreover, this MAS can itself be a compact subsystem of a superior hierarchy MAS composed of several subsystems. This is what we denominate recursive or holonic multi-agent systems.
Linking cognitive science and technology in the preparation of school administrators
Authors: Cathy C. Kaufman
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

As educational systems grow increasingly diverse and decreasingly centralized, integrating the latest finding in both cognitive science and technology can serve as a motivating force in transforming school leadership. Tomorrow's school administrators must be able to function in conditions of paradox, uncertainty, and discontinuity, where their tasks will be continuously modified by a widening arena of community stakeholders. As their roles are reshaped, effective leaders must redefine their significance within a paradox of both flexibility and control. Traditional examinations off instructional leadership have been grounded in learning formal disciplines, general skills, and specific knowledge. A new synthesis argues that pedagogical approaches in how information is presented is equally as important as content of curriculum [Perkins and Saloman 1989]. The most recent cognitive research indicates that the applied meaning of new synthesis in the classroom means teaching school subjects as high-order thinking, critical processing, and real-world applications. This message is equally important in a first grade classroom or in a graduate level university course. A technology-oriented instructional approach to information accessing and processing parallels this new thinking in the cognitive sciences in a way that few traditional classroom resources can claim. It empowers learners of all ages to process new knowledge in more useful and applicable formats that link formal learning with real world problem solving, and perhaps for the first time since the term individualized learning was coined decades ago, technological approaches to learning present the workable structure to actualize this term.
Efficient anonymity-preserving data collection
Authors: Justin Brickell, Vitaly Shmatikov
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

The output of a data mining algorithm is only as good as its inputs, and individuals are often unwilling to provide accurate data about sensitive topics such as medical history and personal finance. Individuals maybe willing to share their data, but only if they are assured that it will be used in an aggregate study and that it cannot be linked back to them. Protocols for anonymity-preserving data collection provide this assurance, in the absence of trusted parties, by allowing a set of mutually distrustful respondents to anonymously contribute data to an untrusted data miner.To effectively provide anonymity, a data collection protocol must be collusion resistant, which means that even if all dishonest respondents collude with a dishonest data miner in an attempt to learn the associations between honest respondents and their responses, they will be unable to do so. To achieve collusion resistance, previously proposed protocols for anonymity-preserving data collection have quadratically many communication rounds in the number of respondents, and employ (sometimes incorrectly) complicated cryptographic techniques such as zero-knowledge proofs.We describe a new protocol for anonymity-preserving, collusion resistant data collection. Our protocol has linearly many communication rounds, and achieves collusion resistance without relying on zero-knowledge proofs. This makes it especially suitable for data mining scenarios with a large number of respondents.
Modelling the Human Values Scale from Consumers Transactional Data Bases
Authors: Javier Guzman-Obando, Gustavo Gonzalez, Josep L. de la Rosa, Ronald U. Ruiz, Jose A. Castan
Venue: Proceedings of the 15th International Conference on Computing (2006)

The main objective of this paper aims at developing a methodology that takes into account the human factor extracted from the data base used by the recommender systems, and which allow to resolve the specific problems of prediction and recommendation. In this work, we propose to extract the user's Human Values Scale from the data base of the users, to improve their suitability in open environments, such as the recommender systems. For this purpose, the methodology is applied with the data of the user after interacting with the system. The methodology is exemplified with a case study.
A tapered SVD without rank determination for estimation of multipulse input time series from noisy output
Authors: H. Kanai, K. Ikikame, N. Chubachi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

One of the key questions to be addressed in this paper is how to estimate the deterministic input multipulse time series from a noisy response of the resonant transfer system in the case where the SNR is low and the system Q (quality factor) of the transfer system is high. By generalizing the sharp truncation employed in the standard singular-value-decomposition (SVD), a tapering window is introduced to truncate high order non-significant singular values obtained by the SVD, the mean squared error of the estimates due to the standard SVD-based estimator is reduced to a minimum. This paper also presents a new method to design an optimum tapering window for estimating multipulse time series.
Steganography in Compressed Video Stream
Authors: Changyong Xu, Xijian Ping, Tao Zhang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this paper, a steganographic algorithm in MPEG compressed video stream was proposed. In each GOP, the control information for to facilitate data extraction was embedded in I frame, in P frames and B frames, the actually transmitted data were repeatedly embedded in motion vectors of macro-blocks that have larger moving speed, for to resist video processing. Data extraction was also performed in compressed video stream without requiring original video. On a GOP by GOP basis, control information in I frame should be extracted firstly, then the embedded data in P and B frames can be extracted based on the control information. Experimental results show that the proposed algorithm has the characteristics of little degrading the visual effect, larger embedding capacity and resisting video processing such as frame adding or frame dropping.
International collaborations in web-based simulation: a focus on experimental design and optimization
Authors: William E. Biles, Jack P. C. Kleijnen
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper summarizes several years of research conducted by the authors to investigate the use of the world-wide web in conducting large-scale simulation studies. The initial efforts, at Tilburg University in 1999, were directed toward accessing several computer processors via the web and assigning each processor a portion of the simulation workload in a parallel replications simulation format. This early work utilized models coded in the Java-based Silk simulation language. By 2001, this research had extended the web-based simulation approach to more widely used simulation languages such as Arena. The present state of this research is that large-scale simulation studies can be conducted on a set of computers, accessed through the web, in a fraction of the time needed using a single processor.
A New Systolic Architecture for Modular Division
Authors: Gang Chen, Guoqiang Bai, Hongyi Chen
Venue: IEEE Transactions on Computers (2007)

A new systolic architecture for modular division is proposed in this paper. The architecture is based on a new hardware algorithm for modular division that is extended from the plus-minus algorithm for the greatest common divisor computation. Both the area complexity and the time complexity of the new architecture are linear with respect to the operand bit length. Compared to the architecture using a redundant number representation proposed by Kaihara and Takagi, the new architecture allows a doubled throughput due primarily to the greatly reduced critical path delay, while the area is only about 20 percent larger. Moreover, it is shown that, with a small addition to the control logic, the architecture can also be used to perform Montgomery modular multiplication, thereby efficiently realizing a unified modular multiplier/divider.
An Approach of a Technique for Effort Estimation of Iterations in Software Projects
Authors: Jose Antonio Pow-Sang, Enrique Jolay-Vasquez
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

The estimation of effort and cost is still one of the hardest tasks in software project management. At the moment, there are many techniques to accomplish this task, such as Function Points, Use Case Points and COCOMO, but there is not much information available about how to use those techniques in non-waterfall software lifecycles such as iterative or spiral lifecycles projects. This paper shows the results obtained when applying a technique to estimate the effort of each construction iteration in software development projects that use iterative-incremental lifecycles. The results were obtained from software projects of a fourth-year course in Informatics. The technique proposes the use of Function Points and COCOMO II.
Coupled heuristic and simulation scheduling in a highly variable environment
Authors: Olga Bagatourova, Sudhakar K. Mallya
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The topic of this paper is workforce scheduling in a highly variable environment -- check proofing and encoding in a bank -- where uncertainties include both volume and arrival pattern of the work. A shop floor simulation model and a heuristic algorithm for workforce scheduling using simulation to estimate objective function are presented. The proposed approach results in a robust workforce schedule that can be easily adjusted in real time in response to environmental changes, such as volume and throughput fluctuations. A planning and scheduling framework within which the simulation is implemented is briefly discussed.
Syntactic Gender and Semantic Expectancy: ERPs Reveal Early Autonomy and Late Interaction
Authors: Thomas C. Gunter, Angela D. Friederici, Herbert Schriefers
Venue: Journal of Cognitive Neuroscience (2000)

This experiment explored the effect of semantic expectancy on the processing of grammatical gender, and vice versa, in German using event-related-potentials (ERPs). Subjects were presented with correct sentences and sentences containing an article-noun gender agreement violation. The cloze probability of the nouns was either high or low. ERPs were measured on the nouns. The low-cloze nouns evoked a larger N400 than the high-cloze nouns. Gender violations elicited a left-anterior negativity (LAN, 300&ndash;600 msec) for all nouns. An additional P600 component was found only in high-cloze nouns. The N400 was independent of the gender mismatch variable; the LAN was independent of the semantic variable, whereas an interaction of the two variables was found in the P600. This finding indicates that syntactic and semantic processes are autonomous during an early processing stage, whereas these information types interact during a later processing phase.
Performance-Based Content Retrieval for Learning Object Repositories on Grid Environments
Authors: Wen-Chung Shih, Chao-Tung Yang, Ping-I Chen, Shian-Shyong Tseng
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

The Sharable Content Object Reference Model (SCORM) has become a popular standard for sharing and reusing teaching materials in the field of elearning. However, efficient retrieval of SCORMcompliant learning objects stored on grid environments is a challenging problem. In this paper, a performance-based approach is proposed to retrieve teaching materials in grid environments. The proposed architecture uses the real-time information gathered by a resource-monitoring tool to estimate the dynamically changing performance of each node, for CPU loading and network bandwidth. In addition, a grid testbed is built to implement the model. Experimental results show that the proposed approach can choose the most appropriate site to reduce the retrieval time.
A Kernel-Based Fuzzy Clustering Algorithm
Authors: Jiun-Hau Wang, Wan-Jui Lee, Shie-Jue Lee
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

We propose a kernel-based fuzzy clustering algorithm to cluster data in the feature space. Our method uses kernel functions to project data from the original space into a high dimensional feature space, and then divides them into groups through their similarities in the feature space with an incremental clustering approach. After clustering, data patterns of the same cluster in the feature space are then grouped with an arbitrarily shaped boundary in the original space. The effectiveness of our method is demonstrated in the experiments.
Legible Collaboration System Design
Authors: Wonsuk NAM, Toshiya FUJII, Ikuro CHOH
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

There is an abundance of idea processing tools available for individual use while, at the same time, there is a shortage of environments supporting collaborative thinking and brainstorming. Additionally, recorded transcripts from meetings, conferences etc. principally consist of letters and symbols to be used as future aid when recalling the proceedings. We argue that this recognition based recording method is limited, since much information cannot be captured in literal data. For example, it is difficult for a non-attendee to recall and experience an accurate reflection of the circumstances surrounding a previous meeting only through these recognition-based recordings. This problem stems not only from the inability to record the other attendant's characteristics and conduct, but also from the difficulty to capture the atmosphere and other surrounding physical information. Thus, there is a need for a system incorporating functions to record physical factors while allowing CSCW (Computer Supported Cooperative Work). In our research, we are developing a table based collaboration support system not strictly limited by time and location. In doing so, we propose an enhanced table with a legible input system supporting direct image manipulation and video recording functions.
Intelligent Framework for Web Design Modeling Based on Automatas and Agents
Authors: Cesar Octavio Maguey Pena
Venue: Proceedings of the 15th International Conference on Computing (2006)

The information explosion generated by an increasing number of web pages requires ways for differentiating one page from others, as well as, how a web site could capture attention of specific customers. There are different approaches for solving these issues, but limited by the lack of the customer navigation knowledge. We propose a framework that exceeds these limits, supporting an intelligent dialog among web sites and customers. This framework is based on automata theory, intelligent agents, and uses asynchronous loading, and XML. It establishes a direct dialog for targeting customer preferences, navigating style, and social or geographic location. It provides to the customer aspects like: customer profile identification, real time experience, ability to change the Web Site environment, facilitating navigation experience accordingly customer needs. Intelligent agents are acting in each one of the states and the given actions provided by the automata. Both components are providing our site model design approach.
Quantitative pharmacophore models with inductive logic programming
Authors: Ashwin Srinivasan, David Page, Rui Camacho, Ross King
Venue: Machine Learning (2006)

Three-dimensional models, or pharmacophores, describing Euclidean constraints on the location on small molecules of functional groups (like hydrophobic groups, hydrogen acceptors and donors, etc.), are often used in drug design to describe the medicinal activity of potential drugs (or `ligands'). This medicinal activity is produced by interaction of the functional groups on the ligand with a binding site on a target protein. In identifying structure-activity relations of this kind there are three principal issues: (1) It is often difficult to "align" the ligands in order to identify common structural properties that may be responsible for activity; (2) Ligands in solution can adopt different shapes (or `conformations') arising from torsional rotations about bonds. The 3-D molecular substructure is typically sought on one or more low-energy conformers; and (3) Pharmacophore models must, ideally, predict medicinal activity on some quantitative scale. It has been shown that the logical representation adopted by Inductive Logic Programming (ILP) naturally resolves many of the difficulties associated with the alignment and multi-conformation issues. However, the predictions of models constructed by ILP have hitherto only been nominal, predicting medicinal activity to be present or absent. In this paper, we investigate the construction of two kinds of quantitative pharmacophoric models with ILP: (a) Models that predict the probability that a ligand is "active"; and (b) Models that predict the actual medicinal activity of a ligand. Quantitative predictions are obtained by the utilising the following statistical procedures as background knowledge: logistic regression and naive Bayes, for probability prediction; linear and kernel regression, for activity prediction. The multi-conformation issue and, more generally, the relational representation used by ILP results in some special difficulties in the use of any statistical procedure. We present the principal issues and some solutions. Specifically, using data on the inhibition of the protease Thermolysin, we demonstrate that it is possible for an ILP program to construct good quantitative structure-activity models. We also comment on the relationship of this work to other recent developments in statistical relational learning.
The role-goal-activity framework revisited: examining student buy-in in a project-based learning environment
Authors: Virginia M. Pitts, Daniel C. Edelson
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

At ICLS 2004 we presented a framework for the study of student participation and engagement in project-based curricula. This framework was specifically designed for the analysis of project-based learning environments in that it explicitly considered the influence of student "buy-in" to an overall scenario on participation and engagement in project-based activities, and identified factors we hypothesized influenced the nature of role- and goal-adoption (including students' scenario-related understandings, attitudes, and beliefs, as well as their perception of the degree of "fit" or alignment between the role and goal and project activities). In this paper, we present the findings of a mixed-methods study we designed, based upon this framework, to examine student role- and goal- adoption in two seventh-grade science classrooms where students participated in the "What Will Survive" life sciences curriculum, and discuss ways in which we plan to revise our framework based on the study results.