Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Jacek Szymanski

dblp:07/5971 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1Databases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Computer networks
1 paper
Network optimization and economics · 50% Network management and operations · 50%
Artificial intelligence
1 paper
Learning theory · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › comparative genomics › conservation analysis
conserved region identification
0.112006
ARCS: an aggregated related column scoring scheme for aligned sequences · Bioinform. 2006
Bioinformatics and computational biology
multiple sequence alignment
0.112006
ARCS: an aggregated related column scoring scheme for aligned sequences · Bioinform. 2006
Bioinformatics and computational biology
sequence analysis
0.112006
ARCS: an aggregated related column scoring scheme for aligned sequences · Bioinform. 2006
Bioinformatics and computational biology › sequence analysis › motif discovery
protein motif discovery
0.012006
ARCS: an aggregated related column scoring scheme for aligned sequences · Bioinform. 2006
Bioinformatics and computational biology
protein structure analysis
0.012006
ARCS: an aggregated related column scoring scheme for aligned sequences · Bioinform. 2006
Network management and operations
network control
0.011997
Experiments with Simple Neural Networks for Real-Time Control · IEEE J. Sel. Areas Commun. 1997
Network optimization and economics
resource allocation
0.011997
Experiments with Simple Neural Networks for Real-Time Control · IEEE J. Sel. Areas Commun. 1997
Machine learning › Learning theory
learning curves
0.011995
Examples of learning curves from a modified VC-formalism · NIPS 1995
Machine learning › Learning theory › computational learning theory
VC theory
0.011995
Examples of learning curves from a modified VC-formalism · NIPS 1995

Methods — techniques the papers use, named apart from their topics

column correlation scoring · 0.1recurrent neural network · 0.0linear programming · 0.0greedy search heuristic · 0.0feedforward neural network · 0.0learning curve analysis · 0.0VC-formalism · 0.0
YearPublicationVenuePosition
2011 Enhancement of Semantic Business Processes with Information Profiles: Application of Mobile Context Information
abstract
Business Process Management (BPM), acknowledging business processes to be key assets of business actors, provides a number of techniques and approaches for improving various aspects of these processes. Recently the concept of Semantic Business Process Management (SBPM) appeared leveraging BPM to the next level by adding the semantic layer to the traditional BPM approach. Still, processes definitions are static and thus pose risk that instances of such processes may not take into consideration the changed business circumstances. Therefore being able to actively modify instances of semantic business processes based on the changes in their economical environment opens for much better efficiency and higher value added of these processes. Using mobile context information can be one of ways of gathering information about the changed economical context.
Jacek Szymanski, Witold Abramowicz
Mobile Data Management (2)1
2006 ARCS: an aggregated related column scoring scheme for aligned sequences
abstract
MOTIVATION: Biologists frequently align multiple biological sequences to determine consensus sequences and/or search for predominant residues and conserved regions. Particularly, determining conserved regions in an alignment is one of the most important activities. Since protein sequences are often several-hundred residues or longer, it is difficult to distinguish biologically important conserved regions (motifs or domains) from others. The widely used tools, Logos, Al2co, Confind, and the entropy-based method, often fail to highlight such regions. Thus a computational tool that can highlight biologically important regions accurately will be highly desired. RESULTS: This paper presents a new scoring scheme ARCS (Aggregated Related Column Score) for aligned biological sequences. ARCS method considers not only the traditional character similarity measure but also column correlation. In an extensive experimental evaluation using 533 PROSITE patterns, ARCS is able to highlight the motif regions with up to 77.7% accuracy corresponding to the top three peaks. AVAILABILITY: The source code is available on http://bio.informatics.indiana.edu/projects/arcs and http://goldengate.case.edu/projects/arcs
Jeong-Hyeon Choi, Guangyu Chen, Jacek Szymanski, Guo-Qiang Zhang 0001, Anthony K. H. Tung, Jaewoo Kang, Sun Kim, Jiong Yang 0001
Bioinform.4
2003 PROTEUS - a European initiative for e-maintenance platform development
abstract
This account presents the foundation of PROTEUS project programme, which consists in designing and modeling of a distributed network orientation platform for integration of maintenance applications. The presentation is focused on basic requirements defining project's rationale and on the development of the platform.
Jacek Szymanski, Thomas Bangemann, Mario Thron, Jean-Pierre Thomesse, Xavier Rebeuf, Christophe Lang, Éric Garcia 0001
ETFA (2)1
1997 Experiments with Simple Neural Networks for Real-Time Control
abstract
We demonstrate the practical ability of neural networks (NNs) trained in a supervised mode to extract useful control "knowledge" from a large, high-dimensional empirical database, and then to deliver almost optimal control in "real time". In particular, this paper describes experiments with NN-based controllers for allocating bandwidth capacity in a telecommunications network (SDH). This system was proposed in order to overcome a "real time" response constraint. Two basic architectures, each consisting of a combination of two methods, are evaluated: (1) a feedforward network-heuristic combination and (2) a feedforward network-recurrent network combination. These architectures are compared against a linear programming (LP) optimizer as a benchmark. This LP optimizer was also used as a teacher to label the data samples for the feedforward NN training algorithm. NN-based solutions are very accurate (/spl sim/98% of optimal throughput) and, in contrast to the algorithmic approach, can be delivered in "real time". It is found that while the "human" generated heuristics (greedy search optimization) fail to find a solution in approximately 30% of cases, the best NN fails only in 4.9% of cases. Moreover, it has been found that in spite of the very high dimensionality of the problem (55 inputs and 126 outputs), the solution can be delivered by surprisingly compact NNs, with as little as around 1000 synaptic weights. This proves that on this occasion the NNs were able to extract simple but powerful "heuristics" hidden in the complex sets of numerical data.
Peter K. Campbell, Alan Christiansen, Michael Dale, Herman L. Ferrá, Adam Kowalczyk, Jacek Szymanski
IEEE J. Sel. Areas Commun.6
1995 Examples of learning curves from a modified VC-formalism
Adam Kowalczyk, Jacek Szymanski, Peter L. Bartlett, Robert C. Williamson
NIPS2