ppxscal/embedding_network huggingface dataset:
PSO Combined with ILS for Flowshop-Based Parallel Task Assignment Problem
Authors: Runpeng Liang, Jiaxiang Luo, Qingqiang Yang, Wenfeng Luo
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

This research explores a new scheduling problem in electronics mounting assembly line: flowshop-based parallel task assignment (FSBPTA), in which the machines are lined flowingly and the tasks--including both the allocation of PCBs and their components, will be assigned to machines for mounting with the objective of minimizing the makespan. The allocation of PCBs has the characteristic of the flowshop scheduling problem (FSSP) while the assignment of the components resembles the job assignment in parallel-machine scheduling problem. To solve this problem, a hybrid algorithm method of Particle Swarm Optimization (PSO) and Iterated Local Search (ILS) is proposed. In this algorithm, ILS is used to help PSO algorithm escape from being trapped into local optima. To testify this hybrid algorithm (PSO ILS), comparisons between PSO ILS and PSO, PSO ILS and multi-start descent algorithm have been advanced. Results show a 9.80% and 3.70% improvement respectively, which illustrate the effectiveness of the proposed algorithm.
Strategies for Information Technology and Intellectual Capital
Authors: Luiz Antonio Joia
Venue:  (2007)

"Due to the increasing importance of the intangible assets of a company, firms are now concerned with how best to manage and measure knowledge and other intangibles. In addition to this, information technology has drastically changed the way these measurements are managed. Strategies for Information Technology and Intellectual Capital: Challenges and Opportunities presents efficient ways for executives and practitioners to understand the impact of IT on the intellectual capital of their firms, as well as search for a new mandate for management in the knowledge economy that takes into consideration the pervasive role of IT on their competitive boundaries. Strategies for Information Technology and Intellectual Capital: Challenges and Opportunities provides a detailed synopsis on the history, origin, taxonomies, ontologies, measurement models, and dynamics of intellectual capital. "
On the Discretization Time-Step in the Finite Element Theta-Method of the Discrete Heat Equation
Authors: Tamás Szabó
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In this paper the numerical solution of the one dimensional heat conduction equation is investigated, by applying Dirichlet boundary condition at the left hand side and Neumann boundary condition was applied at the right hand side. To the discretization in space, we apply the linear finite element method and for the time discretization the well-known theta-method. The aim of the work is to derive an adequate numerical solution for the homogenous initial condition by this approach. We theoretically analyze the possible choice of the time-discretization step-size and establish the interval where the discrete model is reliable to the original physical phenomenon.As the discrete model, we arrive at the task of the one-step iterative method. We point out that there is a need to obtain both lower and upper bounds of the time-step size to preserve the qualitative properties of the real physical solution. The main results of the work is to determine the interval for the time-step size to be used in this special finite element method and analyze the main qualitative characterstics of the model. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Preparation of high school computer science teachers: the Israeli perspective
Authors: Judith Gal-Ezer, Orit Hazzan, Noa Ragonis
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

This special session examines frameworks for the preparation of high school computer science (CS) teachers from the Israeli perspective. Specifically, several Israeli CS teacher preparation programs and their components are presented. The presentation includes both a general overview and a detailed description of the actual implementation of such programs. This bipolar presentation, we suggest, provides practical guidelines with respect to CS teacher preparation, both for policy makers and for faculty members who wish to establish a CS teacher preparation program at their universities.
Designing with an Agile Attitude
Authors: Rebecca J. Wirfs-Brock
Venue: IEEE Software (2009)

This article looks at the attitudes and practices of successful agile software designers.
Fast communication: Influence of low frequency noise in adaptive estimation using the LMS algorithm
Authors: D. S. Brito, Enio Aguiar, Fausto Lucena, R. C. S. Freire, Yoshifumi Yasuda, A. K. Barros
Venue: Signal Processing (2009)

Adaptive systems are employed in the cancelation of noises and estimation of periodic and quasiperiodic signals. Amongst these signals are the electrocardiogram (ECG), impedance cardiography (ZCG), brain evoked potentials and modulated signals in telecommunication applications. In this paper we study the behavior of the weights of the LMS algorithm when used to estimate the coefficients of the discrete Fourier transform (DFT) of a signal under influence of low frequencies. We show theoretically that low frequency noise affects the estimation of the weights at higher frequencies. The simulation results obtained are in agreement with theoretical results. Moreover, we exemplify the problem with impedance cardiography (ZCG) signals.
Distance Measures Induced by Finite Approximation Spaces and Approximation Operators
Authors: Marcin Wolski
Venue: Fundamenta Informaticae (2008)

In this paper we study metric properties of finite approximation spaces and approximation operators from Rough Set Theory. In the first part of the article we examine finite approximation spaces and finite approximation topological spaces regarded as particular instances of two basic types of information structures from the framework of Information Quanta: information quantum relational systems and property systems, respectively. In the second part of the paper is the Marczewski-Steinhaus metric discussed as a certain distance of sets defined with respect to the approximation operators. We propose two types of &aacute; la Marczewski-Steinhaus distance functions: the first type is based on the lower approximation operator; the second one is based on the upper approximation operator. These types can be defined with respect to both finite approximation spaces (information quantum relational systems) and finite approximation topological spaces (property systems), giving us four distancemeasure functions. In order to define a distance of sets which preserves their lower and upper approximations, one can take the sum of two respective functions.
Beyond Documents: Visualizing Informal Communication
Authors: Kurt Schneider, Kai Stapel, Eric Knauss
Venue: Proceedings of the 2008 Requirements Engineering Visualization (2008)

Requirements engineering heavily relies on oral and informal communication like meetings, phone calls, and e-mails. Some requirements are traditionally communicated outside formal documents in many companies. Considering document-based communication only is, therefore, not sufficient. Communication beyond documents should be taken into account when a company wants to improve its requirements engi- neering practices. We present a notation for visualizing the flow of requirements, explicitly including both informal and document-based communication. An example illustrates the notation by applying it to eliciting and validating security requirements. We compare our visualization approach for flows of requirements to related notations. The comparison shows how differences in notations affect the ability to model essential concepts of our approach. Explicitly modeling flows beyond documents provides new opportunities for requirement awareness, process improvement and innovation of tools and techniques.
Context Algebras, Context Frames, and Their Discrete Duality
Authors: Ewa Orłowska, Ingrid Rewitzky
Venue: Transactions on Rough Sets IX (2008)

The data structures dealt with in formal concept analysis are referred to as contexts. In this paper we study contexts within the framework of discrete duality. We show that contexts can be adequately represented by a class of sufficiency algebras called context algebras. On the logical side we define a class of context frames which are the semantic structures for context logic, a lattice-based logic associated with the class of context algebras. We prove a discrete duality between context algebras and context frames, and we develop a Hilbert style axiomatization of context logic and prove its completeness with respect to context frames. Then we prove a duality via truth theorem showing that both context algebras and context frames provide the adequate semantic structures for context logic. We discuss applications of context algebras and context logic to the specification and verification of various problems concerning contexts such as implications (attribute dependencies) in contexts, and derivation of implications from finite sets of implications.
Single-Input Six-Output Voltage-Mode Filter Using Universal Voltage Conveyors
Authors: Martin Minarcik, Kamil Vrba
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this letter a new structure of multifunctional frequency filter using a universal voltage conveyor (UVC) is presented. The multifunctional circuit can realize a low-pass, high-pass and band-pass filter. All types of frequency filter can be realized as inverting or non-inverting. Advantages of the proposed structure are the independent control of the quality factor at the cut-off frequency and the low output impedance of output terminals. The computer simulations and measuring of particular frequency filters are depicted.
Employing topographical height map in colonic polyp measurement and false positive reduction
Authors: Jianhua Yao, Jiang Li, Ronald M. Summers
Venue: Pattern Recognition (2009)

CT colonography (CTC) is an emerging minimally invasive technique for screening and diagnosing colon cancers. Computer aided detection (CAD) techniques can increase sensitivity and reduce false positives. Inspired by the way radiologists detect polyps via 3D virtual fly-through in CTC, we borrowed the idea from geographic information systems to employ topographical height map in colonic polyp measurement and false positive reduction. After a curvature based filtering and a 3D CT feature classifier, a height map is computed for each detection using a ray-casting algorithm. We design a concentric index to characterize the concentric pattern in polyp height map based on the fact that polyps are protrusions from the colon wall and round in shape. The height map is optimized through a multi-scale spiral spherical search to maximize the concentric index. We derive several topographic features from the map and compute texture features based on wavelet decomposition. We then send the features to a committee of support vector machines for classification. We have trained our method on 394 patients (71 polyps) and tested it on 792 patients (226 polyps). Results showed that we can achieve 95% sensitivity at 2.4 false positives per patient and the height map features can reduce false positives by more than 50%. We compute the polyp height and width measurements and correlate them with manual measurements. The Pearson correlations are 0.74 (p=0.11) and 0.75 (p=0.17) for height and width, respectively.
The performance of unpaced serial production lines with unequal coefficients of variation of processing times
Authors: Sabry Shaaban, Sarah Hudson
Venue: International Journal of Computer Applications in Technology (2009)

In this paper, the behaviour of non-automated production lines in terms of their service time coefficients of variation is studied. Results from the simulation of such lines under their steady-state mode of operation with varied buffer storage sizes, number of stations, imbalance configurations and a range of coefficients of variation are presented. Extensive statistical analysis of the output shows that the best pattern (a bowl-shaped arrangement) gives simultaneously lower idle times and lower average buffer levels than those of a balanced line. Predictive formulae and design factor impacts on the endogenous variables are also presented.
The dual-route hypothesis: evaluating a neurocomputational model of fear conditioning in rats
Authors: Robert Lowe, Mark Humphries, Tom Ziemke
Venue: Connection Science (2009)

Research on the neural bases of emotion raises much controversy and few quantitative models exist that can help address the issues raised. Here we replicate and dissect one of those models, Armony and colleagues' neurocomputational model of fear conditioning, which is based on LeDoux's dual-route hypothesis regarding the rat fear circuitry. The importance of the model's modular abstraction of the neuroanatomy, its use of population coding, and in particular the interplay between thalamo-amygdala and thalamo-cortical pathways are tested. We show that a trivially minimal version of the model can produce conditioning to a reinforced stimulus without recourse to the dual pathway structure, but a modification of the original model, which nevertheless preserves the thalamo-amygdala and (reduced) thalamo-cortical pathways, enables stronger conditioning to a conditioned stimulus. Implications for neurocomputational modelling approaches are discussed.
On preparing students for distributed software development with a synchronous, collaborative development platform
Authors: Andrew Meneely, Laurie Williams
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

Working remotely is becoming the norm for both professionals and students alike. Software development has become a global industry due to outsourcing, teleworking, flex time, and companies' desire to use the best and/or most economical talent regardless of where that talent is located. Professionals are not alone because students usually work from home despite having sufficient resources on campus. In this paper we share our experiences from using Jazz, a synchronous, collaborative development platform, with our inevitably distributed software engineering students. Eleven students optionally used the tool while working on a five-week team project. Students primarily used the version control, chat, and work item features in Jazz. We collected their reactions in retrospective essays and found that all Jazz students supported using Jazz in future semesters of the course. We also examined grade differences and found that the students who used Jazz were more successful than those who did not use Jazz.
IT investment and its impact on the efficiency of companies: an analysis with two DEA methods
Authors: Madiagne Diallo, Luiz Felipe R. R. Scarvarda Do Carmo, Luis Eduardo Guedes, Marcus V. Pereira De Souza
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Several companies have been searching for improving their processes aiming at a better performance. In this context, Information Technology investments have shown to be essential in this search for efficiency. The main objective of this work is to show the results obtained by two weight restrictions methods applied to the DEA model, which intends to guide the decision making of investments in Information Technology (IT) in four main concepts: "Equipment", "Training", "Data Storage Capacity" and "Human Resources". The concerned methods are relaxed artificial DMUs and adapted Contingent Weight Restrictions methods. They are compared with classical DEA models.
Balancing Spectral Clustering for Segmenting Spatio-temporal Observations of Multi-agent Systems
Authors: Bálint Takács, Yiannis Demiris
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

We examine the application of spectral clustering for breaking up the behavior of a multi-agent system in space and time into smaller, independent elements. We cluster observations of individualentities in order to identify significant changes in the parameter space (like spatial position)and detect temporal alterations of behavior within the same framework. Data is also influenced byknowledge about important events. Clusters are pre-processed at each step of the iterative subdivision to make the algorithm invariant against spatial scaling, rotation, replay speed andvarying sampling frequency. A method is presented to balance spatial and temporal segmentation based on the expected group size. We demonstrate our results by analyzing the outcomes of acomputer game.
Fast Universal Synchronizers
Authors: Rostislav (Reuven) Dobkin, Ran Ginosar
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

Synchronization circuits are essential in multi-clock-domain systems-on-chip. The most well-known synchronizer consists of two sequentially connected flip-flops that should eliminate the propagation of metastability into the receiver clock domain. We first clarify how such a simple "two-flop" synchronizer can be used in the system, and analyze its performance, showing that the data cycle may be as long as 12 clock cycles. Novel faster synchronizers are described next and their use and improved performance are explained. The fast synchronizer enable shorter data cycles, measuring only 2 to 4 clock cycles. Synchronizer performance is also analyzed when the two communicating clock domains are separated by long interconnect, incurring additional latencies.
Intrusion detection using fuzzy association rules
Authors: Arman Tajbakhsh, Mohammad Rahmati, Abdolreza Mirzaei
Venue: Applied Soft Computing (2009)

Vulnerabilities in common security components such as firewalls are inevitable. Intrusion Detection Systems (IDS) are used as another wall to protect computer systems and to identify corresponding vulnerabilities. In this paper, a novel framework based on data mining techniques is proposed for designing an IDS. In this framework, the classification engine, which is actually the core of the IDS, uses Association Based Classification (ABC). The proposed classification algorithm uses fuzzy association rules for building classifiers. Particularly, the fuzzy association rulesets are exploited as descriptive models of different classes. The compatibility of any new sample (which is to be classified) with different class rulesets is assessed by the use of some matching measures and the class corresponding to the best matched ruleset is declared as the label of the sample. A new method is also proposed to speed up the rule induction algorithm via reducing items that may be included in extracted rules. KDD-99 dataset is used to evaluate the proposed framework. Although results on unseen attacks are not so promising, total detection rate and detection rate of known attacks is significant while false positive rate is kept low. Results are compared with some recent works in the literature using the same dataset. Generally, the proposed approach outperforms other methods, specially in terms of false positive rate.
Moodle: a didactic instrument of online learning for reduce distance handicap
Authors: Emil M. Popa, Daniel Hunyadi, Mircea A. Musan
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

With the various innovations in communications networks hitting the world, it is interesting to note that the traditional means of imparting knowledge in schools and colleges or institutes of higher education have also been impacted to a considerable extent. Socio-economic change of the last years was characterized by globalization of economy and by the arising information society. Both developments have produced new demands: more and more knowledge intensive jobs require a fast and flexible adoption of new knowledge, skills and competencies and novel technologies have created new possibilities for learning, knowledge sharing and communication. Last but not least globalization forces states to co-ordinate their systems of training and education in order to make their economy competitive on the world market. Supporting self-directed and self-organized learning is closely related to the demand of the information society to participate in a process of life-long learning. Today's and future knowledge workers have to cope with the fast change of knowledge and thus be prepared to react fast and manage their further education and training at the workplace. In addition, they have to take responsibility for their own employability. In this context, higher education has an important role to play. We assume that it will be easier for working adults to react and take responsibility of personal learning if they are already prepared and provided scaffolds for this challenge. Competencies in the area of self-direction and self-organisation are an important pre-requisite for successful participation in life-long learning and competence development in information.
Faster Exact Bandwidth
Authors: Marek Cygan, Marcin Pilipczuk
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

We deal with exact algorithms for Bandwidth, a long studied NP-hard problem. For a long time nothing better than the trivial O *(n!) exhaustive search was known. In 2000, Feige an Kilian [4] came up with a O *(10 n )-time algorithm. Since then there has been a growing interest in exponential time algorithms but this bound has not been improved.In this paper we present a new and quite simple O *(5 n ) algorithm. We also obtain even better bound in some special cases.
Robust Higher Order Potentials for Enforcing Label Consistency
Authors: Pushmeet Kohli, L'Ubor Ladický, Philip H. Torr
Venue: International Journal of Computer Vision (2009)

This paper proposes a novel framework for labelling problems which is able to combine multiple segmentations in a principled manner. Our method is based on higher order conditional random fields and uses potentials defined on sets of pixels (image segments) generated using unsupervised segmentation algorithms. These potentials enforce label consistency in image regions and can be seen as a generalization of the commonly used pairwise contrast sensitive smoothness potentials. The higher order potential functions used in our framework take the form of the Robust P n model and are more general than the P n Potts model recently proposed by Kohli et al. We prove that the optimal swap and expansion moves for energy functions composed of these potentials can be computed by solving a st-mincut problem. This enables the use of powerful graph cut based move making algorithms for performing inference in the framework. We test our method on the problem of multi-class object segmentation by augmenting the conventional crf used for object segmentation with higher order potentials defined on image regions. Experiments on challenging data sets show that integration of higher order potentials quantitatively and qualitatively improves results leading to much better definition of object boundaries. We believe that this method can be used to yield similar improvements for many other labelling problems.