Miracle-dz/UniFAR-FTUs huggingface dataset:
Die Einstellungen zur Leistungs-, Lern- und Anpassungsfähigkeit älterer Arbeitnehmer/-innen und die subjektiv erlebte Diskriminierung – eine Untersuchung in Schweizer Unternehmen

Abstract An einer Stichprobe in zwei Schweizer Betrieben wurden die Einstellungen gegenüber älteren Arbeitnehmern/-innen erhoben. Es wurde dabei speziell der Frage nachgegangen, inwiefern die beobachtbare Gleichbehandlung von älteren und jüngeren Arbeitnehmern/-innen bei der Teilnahme an Weiterbildung mit einer positiven Einstellung gegenüber diesen einhergeht. 154 Befragte aus zwei Betrieben beantworteten die deutsche Version des „Fragebogen(s) zur Einstellung gegenüber älteren Arbeitnehmern/-innen“. Dabei zeigte sich eine positivere Einstellung als bei vergleichbaren internationalen Untersuchungen. Denn Führungskräfte und auch die Mitarbeiter/-innen jeden Alters sehen ältere Arbeitnehmer/-innen generell nicht als weniger leistungs- oder lernfähig an. Es ergibt sich vielmehr eine differenzierte Wahrnehmung: Bei der Einschätzung der Leistungsfähigkeit tendieren Ältere dazu, sich positiver einzuschätzen, als jüngere Arbeitnehmer/-innen Ältere einschätzen. Bei der Einschätzung der Lern- und Anpassungsfähigkeit zeigte sich eine umgekehrt u-förmige Beziehung. Die über 60-Jährigen sehen sich selbst als weniger lern- und anpassungsfähig als Altersgruppen zwischen 30 und 59 Jahren. Schließlich fühlen sich Mitarbeiter/-innen mit zunehmendem Alter eher diskriminiert als Führungskräfte. Die Ergebnisse sprechen dafür, dass nicht eine generell negative Einstellung gegenüber älteren Arbeitnehmern/-innen vorliegt, sondern eine zunehmend differenziertere Betrachtung unterschiedlicher Arbeitsleistungs-Dimensionen.
Cats & Co: Categorical Time Series Coclustering

We suggest a novel method of clustering and exploratory analysis of temporal event sequences data (also known as categorical time series) based on three-dimensional data grid models. A data set of temporal event sequences can be represented as a data set of three-dimensional points, each point is defined by three variables: a sequence identifier, a time value and an event value. Instantiating data grid models to the 3D-points turns the problem into 3D-coclustering. The sequences are partitioned into clusters, the time variable is discretized into intervals and the events are partitioned into clusters. The cross-product of the univariate partitions forms a multivariate partition of the representation space, i.e., a grid of cells and it also represents a nonparametric estimator of the joint distribution of the sequences, time and events dimensions. Thus, the sequences are grouped together because they have similar joint distribution of time and events, i.e., similar distribution of events along the time dimension. The best data grid is computed using a parameter-free Bayesian model selection approach. We also suggest several criteria for exploiting the resulting grid through agglomerative hierarchies, for interpreting the clusters of sequences and characterizing their components through insightful visualizations. Extensive experiments on both synthetic and real-world data sets demonstrate that data grid models are efficient, effective and discover meaningful underlying patterns of categorical time series data.
Evaluating anaphora and coreference resolution to improve automatic keyphrase extraction

In this paper we analyze the effectiveness of using linguistic knowledge from coreference and anaphora resolution for improving the performance for supervised keyphrase extraction. In order to verify the impact of these features, we define a baseline keyphrase extraction system and evaluate its performance on a standard dataset using different machine learning algorithms. Then, we consider new sets of features by adding combinations of the linguistic features we propose and we evaluate the new performance of the system. We also use anaphora and coreference resolution to transform the documents, trying to simulate the cohesion process performed by the human mind. We found that our approach has a slightly positive impact on the performance of automatic keyphrase extraction, in particular when considering the ranking of the results.
On-line portfolio selection

We find an on-line portfolio selection strategy which minimizes the worst case regret with respect to the growth rate of wealth achieved by the best off-line optimized constant rebalanced portfolio. The resulting regret is compared to that of the infinite horizon Dirichlet-weighted universal portfolio. Both strategies track the performance of the best off-line constant rebalanced portfolio to first order in the exponent.
A Model-driven Development Environment for Composing and Validating Distributed Real-time and Embedded Systems : A Case Study ∗

Model-driven development (MDD) processes are increasingly being used to develop component middleware and applications for distributed real-time and embedded (DRE) systems in various domains. DRE applications are often missioncritical and have stringent quality of service (QoS) requirements, such as timeliness, predictability and scalability. MDD software techniques are well suited for validating the operation of DRE applications since they offer a higher-level of abstraction than conventional third-generation programmingion than conventional third-generation programming languages. The state-of-the-art in model-driven DRE application development is still maturing, however. For example, conventional MDD development environments for DRE application do not yet provide seamless integration of development capabilities and model checking capabilities. This paper presents three contributions towards an integrated MDD development and model checking environment for DRE applications. First, we describe how our CoSMIC MDD middleware development toolsuite has been combined with the Cadena model checking toolsuite to provide an integrated environment that accelerates the development and validation of DRE applications. Second, we discuss the technical difficulties encountered integrating these tools in the context of a DRE application case study. Third, we discuss R&D issues associated with implementing MDD algorithms for maintaining lossless and semantics-preserving data transfer across the tools. Our results show that interoperation between significantly different tools for MDD is achievable with the proper choice of communication format, semantics, and the development of a reliable graph diff-merge algorithm.
Indirect Measures of Deviant Sexual Interest

Latency and accuracy-based indirect measures have become of increasing interest to researchers and clinicians who work with sexual offenders. Most notably, they have been regarded as a useful tool for measuring deviant sexual interests, as they are thought to circumvent many of the issues associated with existing assessment tools. Thus, over the past 10 years, a number of tasks have been adapted to indirectly assess deviant sexual interest and an increasing body of research detailing their utility and psychometric properties has amassed. In this chapter, we examine this literature, providing a comprehensive overview that we hope proves useful for both clinicians and researchers. Specifically, details on how each measure works; their underlying rationale; their validity and reliability; and their limitations are discussed. Suggestions for future research are also offered throughout the chapter.
Aware Multicast Implementation based on P-Grid

This paper presents the implementation viewpoint of Data Aware Multicast, a multicast algorithm for peer-to-peer dissemination of events in a distributed, topic-based, publishsubscribe system. The implementation is based on P-Grid, a structured, completely decentralized, self-organizing peer-to-peer system. We discuss various design approaches to interconnecting the algorithm with the underlying peer-to-peer system going from a loose dependency to a highly coupled solution and describe their advantages and drawbacks. The two implementations rely on the most promising design approaches and have similar structures, apart from the group membership layer. Some implementation difficulties arise from the efficient exploitation of P-Grid, others from ensuring the integrity of the data structures required by the algorithm. The test results provide means to compare the two implementations and their overall performance.
THE RATE OF SUPERNOVAE FROM THE COMBINED SAMPLE OF FIVE SEARCHES

With the purpose to obtain new estimates of the rate ofsupernovaewejoinedthelogsofveSNsearches,namelythe Asiago, Crimea, Calan-Tololo and OCA photographic surveys and the visual search by Evans. In this way we improved the SN statistics (the sample counts 110 SNe) and hence, reduced the uncertainties. The computation was based on the control time method which allowed the proper merging of the observations of each galaxy in the various searches. In addition to discussing the choice for the various input parameters, we veried the exis- tence of two biases against SN discoveries, one in the nuclear regions of distant galaxies, most severe for deep photographic surveys, and a second in inclined spirals, in particular late spi- rals. After correction for these two biases we obtained the rates of each SN type in the different types of galaxies. We found that the most prolic galaxies are late spirals in which most SNe are of type II (0.88 SNu). SN Ib/c are rarer than SN Ia (0.16 and 0.24 SNu, respectively), ruling out previous claims of a very high rate of SNIb/c. We also found that the rate of SN Ia in ellipticals (0.13 SNu) is smaller than in spirals, supporting the hypothesis of different ages of the progenitor systems in early and late type galaxies. Finally, we estimated that even assuming that separate classes of faint SN Ia and SN II do exist (SNe 1991bg and 1987A could be the respective prototypes) the overall SN rate is raised only by 20-30%, therefore excluding that faint SNe represent the majority of SN explosions. Also, the bright SNIIn are intrinsically very rare (2 t o5%o f allSNII in spirals).
Spatio-Temporal Modeling of a Campus WLAN

Campus wireless LANs (WLANs) are complex systems with hundreds of access points (APs) and thousands of users. Researchers in wireless networking are faced with the challenge of constructing simulations and testbed experiments that reproduce the characteristics of these networks, and taking them into account in their theoretical work. However, there is only a limited set of modeling results in this area derived from real measurement data, and they do not provide a complete and consistent view of entire WLAN systems. In this work we propose a first system-wide, multi-level model for campus WLAN. Our emphasis is on parametric modeling, which provides a parsimonious characterization and the most flexible foundation for simulation studies. Our results are derived from large traces collected at the University of North Carolina.
Learning model based control of lightweight robotic arms

—Robots are slowly entering into the unstructured environments populated with humans where traditional control techniques, applied in industrial settings, are becoming inadequate. Reasons for this are that we can not pre-progam tasks in advance reliably and the usual assumption of rigid body dynamics is violated for most lightweight robotic arms. Learning techniques allow for learning models form data only, with no assumptions on structure which allows for learning of nonlinearities and other dynamics that are hard to take into account explicitly. As the data in robots are usually available through sensors readings supervised techniques are in the focus of this paper with application to robotic manipulator modeling and control
Active key management scheme to avoid clone attack in wireless sensor network

In Wireless sensor Network, the sensor nodes transmit critical information over the network; therefore, security services, such as, authentication and pair wise key establishment between sensor nodes and mobile sinks, are important. However, the problem of authentication and pair wise key establishment in sensor networks with MSs is still not solved in the face of mobile sink replication attacks. For the basic probabilistic and q-composite key pre distribution schemes, an attacker can easily obtain a large number of keys by capturing a small fraction of the network sensor nodes, making it possible for the attacker to take control of the entire network by deploying a replicated mobile sink, preloaded with some compromised keys to authenticate and then initiate data communication with any sensor node. To solve this problem, we have developed a general framework that permits the use of any pair wise key pre distribution scheme as its basic component, to provide authentication and pair wise key establishment between sensor nodes and MSs. The new framework requires two separate key pools, one for the mobile sink to access the network, and one for pair wise key establishment between the sensors.
Mondriaan Memory Protection : Fine-Grained Protection with Translation

Introduction: Mondriaan memory protection (MMP) is a fine-grained protection scheme that allows multiple protection domains to flexibly share memory and export protected services. In contrast to earlier page-based systems, MMP allows arbitrary permissions control at the granularity of individual words. We use a compressed permissions table to reduce space overheads and employ two levels of permissions caching to reduce run-time overheads. The protection tables in our implementation add less than 9% overhead to the memory space used by the application. Accessing the protection tables adds less than 8% additional memory references to the accesses made by the application. Although it can be layered on top of demand-paged virtual memory, MMP is also well-suited to embedded systems with a single physical address space. We extend MMP to support segment translation which allows a memory segment to appear at another location in the address space. We use this translation to implement zero-copy networking underneath the standard read system call interface, where packet payload fragments are connected together by the translation system to avoid data copying. This saves 52% of the memory references used by a traditional copying network stack.
PENGARUH PENGALAMAN KERJA, PENGAWASAN KERJA DAN SPESIALISASI KERJA TERHADAP PEMAHAMAN BEBAN KERJA DENGAN PEMANFAATAN TEKNOLOGI INFORMASI SEBAGAI VARIABEL INTERVENING (STUDI KASUS DI DINAS PASAR KOTA SEMARANG)

Semarang City Market Agency in order to provide services to the public to experience problems, the indication appears on the low utilization of information technology by employees in the institutions which have an impact on the lack of understanding for their workload. Presumably it is motivated by the lack of work experience, lack of supervision of work and lack of specialization of work imposed by management. The formulation of the problem in this research is how the management of the Office of Market Semarang trying to improve the utilization of information technology for its employees, so that employees understanding of the work load of each may rise as well. The population in this study were all employees in Semarang City Market Agency numbering 80 people and sampling techniques using census method, where all populations sampled. Data analysis technique used is multiple linear regression 2 stages and Goodness of Fit test. The analysis showed that the work experience and specialization of work partially affect the utilization of information technology, each with a value of t count equal to 2,326 and 0.2196> t table 1.66462, while oversight of the work does not affect the use of information technology for the t value amounted to - 0.810 F table 2.72. Utilization of information technology positively and significantly to the understanding of the workload, because t value unstandardized predicted value use of information technology by 6,340> t table 1.66462. Keywords: work experience, supervision of work, specialization of labor, use of information technology and understanding of workload
Identification of key amino acids responsible for the distinct aggregation properties of microtubule‐associated protein 2 and tau

The carboxyl‐terminal sequence of tau composes the framework for its intracellular inclusions that appear in diverse neurodegenerative disorders known as tauopathies. However, microtubule‐associated protein 2 (MAP2), which contains a homologous carboxyl‐terminal sequence of tau, is undetectable in the mature tau inclusions. The mechanisms underlying this phenomenon have remained largely unknown. Here, we show that tau and MAP2 have different aggregation properties: tau aggregates to form filaments but MAP2 remains to be granules. Exchanging 221YKPV224 of tau (0N3R) near the PHF6 motif for 340TKKI343 of MAP2c profoundly changed aggregation properties, suggesting that the YKPV motif is important for filament formation, whereas the TKKI motif is for granule formation. Thus, these minimal sequences may determine the different fates of tau and MAP2 in the formation of inclusions in tauopathies.
The Globular Cluster System in the Inner Region of the Giant Elliptical Galaxy NGC 4472

We present a study of globular clusters in the inner region of the giant elliptical galaxy NGC 4472, based on the HST/WFPC2 archive data. We have found about 1560 globular cluster candidates at the galactocentric radius r < 4′, most of which are located within r = 1. ′1. A V-(V-I) diagram of these objects shows a dominant vertical structure obviously consisting of two components: blue globular clusters (BGCs) and red globular clusters (RGCs). The luminosity function of the globular clusters is derived to have a peak at V(max) = 23.50 ± 0.16 mag and σ = 1.19 ± 0.09 from Gaussian fitting. From this result the distance to NGC 4472 is estimated to be d = 14.7 ± 1.3 Mpc, for the foreground reddening E(V-I) = 0.03 and the peak luminosity for the Galactic globular clusters of MV(max) = -7.4 mag. The peak luminosity for the RGCs is similar to that for the BGCs, which indicates that the RGCs may be several gigayears younger than the BGCs. The luminosity function of the globular clusters shows little systematic variation depending on the galactocentric radius at r < 4′. However, the mean luminosity of the bright BGCs decreases by 0.2 mag with increasing galactocentric radius over the range of 9′, while that of the RGCs does not. The observed color distribution of these globular clusters is distinctively bimodal, with peaks at (V-I) = 0.98 ± 0.01 and 1.23 ± 0.01, which correspond to the metallicities of [Fe/H] = -1.41 and -0.23 dex, respectively. The mean observed color of all the globular clusters with V < 23.9 mag is derived to be (V-I) = 1.11 ± 0.01 (m.e.), corresponding to the metallicity of [Fe/H] = -0.79 ± 0.05 dex. These colors are exactly the same as those for the globular clusters in M87. It is found that the relative number of the BGCs to the RGCs is increasing with the increasing galactocentric radius. There are more RGCs than the BGCs within r ∼ 2′, while there are fewer RGCs than the BGCs in the outer region of NGC 4472. Radial and azimuthal structures of the globular cluster system in NGC 4472 are also investigated. Surface number density profiles of both the BGCs and RGCs become flat in the central region, and the core radii of the globular cluster systems are measured to be rc = 1. ′9 for the BGCs, rc = 1. ′2 for the RGCs and rc = 1. ′3 for the total sample, which are much larger than the stellar core of the galaxy. In general the properties of the globular clusters in the inner region of NGC 4472 are consistent with those of the globular clusters in the outer region of NGC 4472.
A key based security mechanism for payment status in cloud service access control system

Cloud computing is widely accepted dominant paradigm that provides a number of resources and cost effective software services to their clients as they demand such as Software as a Service, Platform as a Service and Infrastructure as a Service. However these services provide a lot of benefits for their clients, but still there is a need of data security against unauthorized access of services (data). Access control is an important aspect of cloud computing to enhance the system security. This paper focus on securing the pay-as-you-go model used by cloud service access model (CSAC) using combination of RSA and AES algorithm to ensure that only authorized user access the services from cloud. It also provides the mechanism to detect the conflicts between policies and inhibits the access due to conflicts in the environment of cloud computing. This paper gives an insight into the enhancement of the security to access the services from cloud by proposed access control model. With this aim, this paper presents a secure access control model which allows legal access of services.
A similarity graph-based approach to declustering problems and its application towards parallelizing grid files

We propose a new similarity-based technique for declustering data. The proposed method can adapt to available information about query distributions, data distributions, data sizes and partition-size constraints. The method is based on max-cut partitioning of a similarity graph defined over the given set of data, under constraints on the partition sizes. It maximizes the chances that a pair of data-items that are to be accessed together by queries are allocated to distinct disks. We show that the proposed method can achieve optimal speed-up for a query-set, if there exists any other declustering method which will achieve the optimal speed-up. Experiments in parallelizing grid files show that the proposed method outperforms mapping-function-based methods for interesting query distributions as well for non-uniform data distributions. <<ETX>>
Route change latency in low-power and lossy wireless networks using RPL and 6LoWPAN Neighbor Discovery

The IETF ROLL WG is currently in the final steps of the specification of RPL, a new routing protocol for low power and lossy networks (e.g. wireless sensor networks). RPL may use layer two- and layer three-based mechanisms for neighbor reachability maintenance. Since layer two mechanisms may not always be available, RPL relies by default on the 6LoWPAN Neighbor Discovery, a version of the IPv6 Neighbor Discovery which is optimized for LLNs. This paper provides an analysis of the impact of various RPL and 6LoWPAN Neighbor Discovery parameter settings on the link availability and end-to-end path availability, and the related message overhead. Results show that careful tuning of the relevant parameters is critical for obtaining good network performance.
Parameter determination of synchrnous machine with radial permanent magnets using analytical calculation and standstill tests

In this paper, the two methods used and compared for obtaining the values of direct axis and quadrature synchronous reactance, as well as leakage reactance of the permanent magnet synchronous motor with radial magnets (RPMSM) are: analytical calculation of parameters, and the standstill tests, with locked rotor. The rotor of the motor studied in this paper contains embedded symmetrical sections of aluminum molded squirrel cage. The stator phase winding consists of two sets of turns that can be connected either, in parallel or series, providing a dual voltage connection of the PMSM across three-phase 230V or 460V. The two methods described in this paper showed good correlation of results. These resulting values are required as inputs for the specification of the controller parameters of AC drives using RPMSM.